n=int(input())
p=[]
for i in range(n):
  p.append(list(map(int,input().split())))
p.sort()

c=[set() for i in range(n)]
for i in range(n):
  for j in range(n):
    c[i].add((p[i][0]-p[j][0],p[i][1]-p[j][1]))
mn=1 if n==1 else 100
for i in range(n):
  for j in range(i+1,n):
    cnt=0
    pq=(p[i][0]-p[j][0],p[i][1]-p[j][1])
    for k in range(n):
      if not(pq in c[k]):
        cnt+=1
    mn=min(mn,cnt)
print(mn) n=int(input()) n int(input()) int input() input p=[] p [] for i in range(n):
  p.append(list(map(int,input().split()))) i range(n) range n p.append(list(map(int,input().split()))) p.append p append list(map(int,input().split())) list map(int,input().split()) map int input().split() ().split () input split p.sort() p.sort p sort set() for i in range(n) for i in range(n) i range(n) range n for i in range(n) set() set c=[set() for i in range(n)] c [set() for i in range(n)] for i in range(n):
  for j in range(n):
    c[i].add((p[i][0]-p[j][0],p[i][1]-p[j][1])) i range(n) range n for j in range(n):
    c[i].add((p[i][0]-p[j][0],p[i][1]-p[j][1])) j range(n) range n c[i].add((p[i][0]-p[j][0],p[i][1]-p[j][1])) [i].add [i] c i add (p[i][0]-p[j][0],p[i][1]-p[j][1]) p[i][0]-p[j][0] p[i][0] [i] p i 0 p[j][0] [j] p j 0 p[i][1]-p[j][1] p[i][1] [i] p i 1 p[j][1] [j] p j 1 mn=1 if n==1 else 100 mn 1 if n==1 else 100 n==1 n 1 1 100 for i in range(n):
  for j in range(i+1,n):
    cnt=0
    pq=(p[i][0]-p[j][0],p[i][1]-p[j][1])
    for k in range(n):
      if not(pq in c[k]):
        cnt+=1
    mn=min(mn,cnt) i range(n) range n for j in range(i+1,n):
    cnt=0
    pq=(p[i][0]-p[j][0],p[i][1]-p[j][1])
    for k in range(n):
      if not(pq in c[k]):
        cnt+=1
    mn=min(mn,cnt) j range(i+1,n) range i+1 i 1 n cnt=0 cnt 0 pq=(p[i][0]-p[j][0],p[i][1]-p[j][1]) pq (p[i][0]-p[j][0],p[i][1]-p[j][1]) p[i][0]-p[j][0] p[i][0] [i] p i 0 p[j][0] [j] p j 0 p[i][1]-p[j][1] p[i][1] [i] p i 1 p[j][1] [j] p j 1 for k in range(n):
      if not(pq in c[k]):
        cnt+=1
     k range(n) range n if not(pq in c[k]):
        cnt+=1
     not(pq in c[k]) pq in c[k] pq c[k] c k cnt+=1 cnt 1 mn=min(mn,cnt) mn min(mn,cnt) min mn cnt print(mn) print mn mn=1 if n==1 else 100 1 if n==1 else 100 mn pq=(p[i][0]-p[j][0],p[i][1]-p[j][1]) (p[i][0]-p[j][0],p[i][1]-p[j][1]) pq cnt=0 0 cnt c=[set() for i in range(n)] [set() for i in range(n)] c mn=min(mn,cnt) min(mn,cnt) mn cnt+=1 1 cnt p=[] [] p n=int(input()) int(input()) n
n=int(input())
p=[]
for i in range(n):
  p.append(list(map(int,input().split())))
p.sort()

c=[set() for i in range(n)]
for i in range(n):
  for j in range(n):
    c[i].add((p[i][0]-p[j][0],p[i][1]-p[j][1]))
mn=1 if n==1 else 100
for i in range(n):
  for j in range(i+1,n):
    cnt=0
    pq=(p[i][0]-p[j][0],p[i][1]-p[j][1])
    for k in range(n):
      if not(pq in c[k]):
        cnt+=1
    mn=min(mn,cnt)
print(mn)
