N = int(input())
xy = [list(map(int,input().split())) for _ in range(N)]

ans = 0

for i in range(N-1):
  x1,y1 = xy[i]
  for j in range(i+1,N):
    x2,y2 = xy[j]
    p = x2-x1
    q = y2-y1
    cost = 0
    for x,y in xy:
      if [x-p,y-q] in xy:
        cost += 1
    ans = max(ans,cost)
    
print(N-ans) N = int(input()) N int(input()) int input() input list(map(int,input().split())) for _ in range(N) for _ in range(N) _ range(N) range N for _ in range(N) list(map(int,input().split())) list map(int,input().split()) map int input().split() ().split () input split xy = [list(map(int,input().split())) for _ in range(N)] xy [list(map(int,input().split())) for _ in range(N)] ans = 0 ans 0 for i in range(N-1):
  x1,y1 = xy[i]
  for j in range(i+1,N):
    x2,y2 = xy[j]
    p = x2-x1
    q = y2-y1
    cost = 0
    for x,y in xy:
      if [x-p,y-q] in xy:
        cost += 1
    ans = max(ans,cost)
     i range(N-1) range N-1 N 1 x1,y1 = xy[i] x1 xy[i] xy i y1 for j in range(i+1,N):
    x2,y2 = xy[j]
    p = x2-x1
    q = y2-y1
    cost = 0
    for x,y in xy:
      if [x-p,y-q] in xy:
        cost += 1
    ans = max(ans,cost)
     j range(i+1,N) range i+1 i 1 N x2,y2 = xy[j] x2 xy[j] xy j y2 p = x2-x1 p x2-x1 x2 x1 q = y2-y1 q y2-y1 y2 y1 cost = 0 cost 0 for x,y in xy:
      if [x-p,y-q] in xy:
        cost += 1
     x y xy if [x-p,y-q] in xy:
        cost += 1
     [x-p,y-q] in xy [x-p,y-q] x-p x p y-q y q xy cost += 1 cost 1 ans = max(ans,cost) ans max(ans,cost) max ans cost print(N-ans) print N-ans N ans N = int(input()) int(input()) N q = y2-y1 y2-y1 q x1,y1 = xy[i] xy[i] x1 y1 = xy[i] xy[i] y1 y2 = xy[j] xy[j] y2 p = x2-x1 x2-x1 p cost = 0 0 cost x2,y2 = xy[j] xy[j] x2 ans = 0 0 ans cost += 1 1 cost xy = [list(map(int,input().split())) for _ in range(N)] [list(map(int,input().split())) for _ in range(N)] xy ans = max(ans,cost) max(ans,cost) ans
N = int(input())
xy = [list(map(int,input().split())) for _ in range(N)]

ans = 0

for i in range(N-1):
  x1,y1 = xy[i]
  for j in range(i+1,N):
    x2,y2 = xy[j]
    p = x2-x1
    q = y2-y1
    cost = 0
    for x,y in xy:
      if [x-p,y-q] in xy:
        cost += 1
    ans = max(ans,cost)
    
print(N-ans)