n=int(input())
l=[list(map(int,input().split())) for i in range(n)]
a=[]
for i in range(n):
    for j in range(n):
        if i!=j:
            a.append([l[i][0]-l[j][0],l[i][1]-l[j][1]])
#print(a)
m=len(a)
ans=0
for k in range(m):
    c=0
    p=a[k][0]
    q=a[k][1]
    for i in range(n):
        for j in range(n):
            if i!=j and [l[i][0]-l[j][0],l[i][1]-l[j][1]]==[p,q]:
                c+=1
    ans=max(ans,c)
if n==1:
    print(1)
else:
    print(n-ans)
 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 l=[list(map(int,input().split())) for i in range(n)] l [list(map(int,input().split())) for i in range(n)] a=[] a [] for i in range(n):
    for j in range(n):
        if i!=j:
            a.append([l[i][0]-l[j][0],l[i][1]-l[j][1]])
#print(a) i range(n) range n for j in range(n):
        if i!=j:
            a.append([l[i][0]-l[j][0],l[i][1]-l[j][1]])
#print(a) j range(n) range n if i!=j:
            a.append([l[i][0]-l[j][0],l[i][1]-l[j][1]])
#print(a) i!=j i j a.append([l[i][0]-l[j][0],l[i][1]-l[j][1]]) a.append a append [l[i][0]-l[j][0],l[i][1]-l[j][1]] l[i][0]-l[j][0] l[i][0] [i] l i 0 l[j][0] [j] l j 0 l[i][1]-l[j][1] l[i][1] [i] l i 1 l[j][1] [j] l j 1 m=len(a) m len(a) len a ans=0 ans 0 for k in range(m):
    c=0
    p=a[k][0]
    q=a[k][1]
    for i in range(n):
        for j in range(n):
            if i!=j and [l[i][0]-l[j][0],l[i][1]-l[j][1]]==[p,q]:
                c+=1
    ans=max(ans,c) k range(m) range m c=0 c 0 p=a[k][0] p a[k][0] [k] a k 0 q=a[k][1] q a[k][1] [k] a k 1 for i in range(n):
        for j in range(n):
            if i!=j and [l[i][0]-l[j][0],l[i][1]-l[j][1]]==[p,q]:
                c+=1
     i range(n) range n for j in range(n):
            if i!=j and [l[i][0]-l[j][0],l[i][1]-l[j][1]]==[p,q]:
                c+=1
     j range(n) range n if i!=j and [l[i][0]-l[j][0],l[i][1]-l[j][1]]==[p,q]:
                c+=1
     i!=j and [l[i][0]-l[j][0],l[i][1]-l[j][1]]==[p,q] i!=j i j [l[i][0]-l[j][0],l[i][1]-l[j][1]]==[p,q] [l[i][0]-l[j][0],l[i][1]-l[j][1]] l[i][0]-l[j][0] l[i][0] [i] l i 0 l[j][0] [j] l j 0 l[i][1]-l[j][1] l[i][1] [i] l i 1 l[j][1] [j] l j 1 [p,q] p q c+=1 c 1 ans=max(ans,c) ans max(ans,c) max ans c if n==1:
    print(1)
else:
    print(n-ans) n==1 n 1 print(1) print 1 print(n-ans) print n-ans n ans c+=1 1 c m=len(a) len(a) m n=int(input()) int(input()) n c=0 0 c q=a[k][1] a[k][1] q ans=0 0 ans ans=max(ans,c) max(ans,c) ans a=[] [] a l=[list(map(int,input().split())) for i in range(n)] [list(map(int,input().split())) for i in range(n)] l p=a[k][0] a[k][0] p
n=int(input())
l=[list(map(int,input().split())) for i in range(n)]
a=[]
for i in range(n):
    for j in range(n):
        if i!=j:
            a.append([l[i][0]-l[j][0],l[i][1]-l[j][1]])
#print(a)
m=len(a)
ans=0
for k in range(m):
    c=0
    p=a[k][0]
    q=a[k][1]
    for i in range(n):
        for j in range(n):
            if i!=j and [l[i][0]-l[j][0],l[i][1]-l[j][1]]==[p,q]:
                c+=1
    ans=max(ans,c)
if n==1:
    print(1)
else:
    print(n-ans)

