N=int(input())
X=[list(map(int,input().split())) for i in range(N)]
def solve(p,q):
  global N,X
  r=0
  for i in range(N):
    for j in range(N):
      if X[i][0]+p==X[j][0] and X[i][1]+q==X[j][1]:
        r-=1
  return r

P=0
for i in range(N):
  for j in range(i+1,N):
    P=min(P,solve(X[j][0]-X[i][0],X[j][1]-X[i][1]))
print(N+P) N=int(input()) N int(input()) int input() input list(map(int,input().split())) for i in range(N) for i in range(N) i range(N) range N for i in range(N) list(map(int,input().split())) list map(int,input().split()) map int input().split() ().split () input split X=[list(map(int,input().split())) for i in range(N)] X [list(map(int,input().split())) for i in range(N)] def solve(p,q):
  global N,X
  r=0
  for i in range(N):
    for j in range(N):
      if X[i][0]+p==X[j][0] and X[i][1]+q==X[j][1]:
        r-=1
  return r solve global N,X r=0 r 0 for i in range(N):
    for j in range(N):
      if X[i][0]+p==X[j][0] and X[i][1]+q==X[j][1]:
        r-=1
   i range(N) range N for j in range(N):
      if X[i][0]+p==X[j][0] and X[i][1]+q==X[j][1]:
        r-=1
   j range(N) range N if X[i][0]+p==X[j][0] and X[i][1]+q==X[j][1]:
        r-=1
   X[i][0]+p==X[j][0] and X[i][1]+q==X[j][1] X[i][0]+p==X[j][0] X[i][0]+p X[i][0] [i] X i 0 p X[j][0] [j] X j 0 X[i][1]+q==X[j][1] X[i][1]+q X[i][1] [i] X i 1 q X[j][1] [j] X j 1 r-=1 r 1 return r r p p q q P=0 P 0 for i in range(N):
  for j in range(i+1,N):
    P=min(P,solve(X[j][0]-X[i][0],X[j][1]-X[i][1])) i range(N) range N for j in range(i+1,N):
    P=min(P,solve(X[j][0]-X[i][0],X[j][1]-X[i][1])) j range(i+1,N) range i+1 i 1 N P=min(P,solve(X[j][0]-X[i][0],X[j][1]-X[i][1])) P min(P,solve(X[j][0]-X[i][0],X[j][1]-X[i][1])) min P solve(X[j][0]-X[i][0],X[j][1]-X[i][1]) solve X[j][0]-X[i][0] X[j][0] [j] X j 0 X[i][0] [i] X i 0 X[j][1]-X[i][1] X[j][1] [j] X j 1 X[i][1] [i] X i 1 print(N+P) print N+P N P X=[list(map(int,input().split())) for i in range(N)] [list(map(int,input().split())) for i in range(N)] X P=min(P,solve(X[j][0]-X[i][0],X[j][1]-X[i][1])) min(P,solve(X[j][0]-X[i][0],X[j][1]-X[i][1])) P N=int(input()) int(input()) N P=0 0 P def solve(p,q):
  global N,X
  r=0
  for i in range(N):
    for j in range(N):
      if X[i][0]+p==X[j][0] and X[i][1]+q==X[j][1]:
        r-=1
  return r def solve(p,q):
  global N,X
  r=0
  for i in range(N):
    for j in range(N):
      if X[i][0]+p==X[j][0] and X[i][1]+q==X[j][1]:
        r-=1
  return r solve
N=int(input())
X=[list(map(int,input().split())) for i in range(N)]
def solve(p,q):
  global N,X
  r=0
  for i in range(N):
    for j in range(N):
      if X[i][0]+p==X[j][0] and X[i][1]+q==X[j][1]:
        r-=1
  return r

P=0
for i in range(N):
  for j in range(i+1,N):
    P=min(P,solve(X[j][0]-X[i][0],X[j][1]-X[i][1]))
print(N+P)