# coding: utf-8
# Your code here!
N=int(input())

l=[]
for i in range(N):
    l.append(list(map(int,input().split())))

dis=[[0]*(N) for i in range(N-1)]
#print(dis)

for i in range(N-1):
    for j in range(i+1,N):
        if l[i][0]-l[j][0]>0:
            dis[i][j]=[(l[i][0]-l[j][0]),(l[i][1]-l[j][1])]
        elif l[i][0]-l[j][0]<0:
            dis[i][j]=[-(l[i][0]-l[j][0]),-(l[i][1]-l[j][1])]
        else:
            dis[i][j]=[(l[i][0]-l[j][0]),abs(l[i][1]-l[j][1])]

temp=0
for i in range(N-1):
    for item in dis[i]:
        if item!=0:
            temp=max(sum(x.count(item) for x in dis),temp)

#print(l)
#print(dis)
print(N-temp)
 N=int(input()) N int(input()) int input() input l=[] l [] for i in range(N):
    l.append(list(map(int,input().split()))) i range(N) range N l.append(list(map(int,input().split()))) l.append l append list(map(int,input().split())) list map(int,input().split()) map int input().split() ().split () input split [0]*(N) for i in range(N-1) for i in range(N-1) i range(N-1) range N-1 N 1 for i in range(N-1) [0]*(N) [0] 0 N dis=[[0]*(N) for i in range(N-1)] dis [[0]*(N) for i in range(N-1)] for i in range(N-1):
    for j in range(i+1,N):
        if l[i][0]-l[j][0]>0:
            dis[i][j]=[(l[i][0]-l[j][0]),(l[i][1]-l[j][1])]
        elif l[i][0]-l[j][0]<0:
            dis[i][j]=[-(l[i][0]-l[j][0]),-(l[i][1]-l[j][1])]
        else:
            dis[i][j]=[(l[i][0]-l[j][0]),abs(l[i][1]-l[j][1])] i range(N-1) range N-1 N 1 for j in range(i+1,N):
        if l[i][0]-l[j][0]>0:
            dis[i][j]=[(l[i][0]-l[j][0]),(l[i][1]-l[j][1])]
        elif l[i][0]-l[j][0]<0:
            dis[i][j]=[-(l[i][0]-l[j][0]),-(l[i][1]-l[j][1])]
        else:
            dis[i][j]=[(l[i][0]-l[j][0]),abs(l[i][1]-l[j][1])] j range(i+1,N) range i+1 i 1 N if l[i][0]-l[j][0]>0:
            dis[i][j]=[(l[i][0]-l[j][0]),(l[i][1]-l[j][1])]
        elif l[i][0]-l[j][0]<0:
            dis[i][j]=[-(l[i][0]-l[j][0]),-(l[i][1]-l[j][1])]
        else:
            dis[i][j]=[(l[i][0]-l[j][0]),abs(l[i][1]-l[j][1])] l[i][0]-l[j][0]>0 l[i][0]-l[j][0] l[i][0] [i] l i 0 l[j][0] [j] l j 0 0 dis[i][j]=[(l[i][0]-l[j][0]),(l[i][1]-l[j][1])] dis[i][j] [i] dis i j [(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 elif l[i][0]-l[j][0]<0:
            dis[i][j]=[-(l[i][0]-l[j][0]),-(l[i][1]-l[j][1])]
         l[i][0]-l[j][0]<0 l[i][0]-l[j][0] l[i][0] [i] l i 0 l[j][0] [j] l j 0 0 dis[i][j]=[-(l[i][0]-l[j][0]),-(l[i][1]-l[j][1])] dis[i][j] [i] dis i j [-(l[i][0]-l[j][0]),-(l[i][1]-l[j][1])] -(l[i][0]-l[j][0]) 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]-l[j][1] l[i][1] [i] l i 1 l[j][1] [j] l j 1 dis[i][j]=[(l[i][0]-l[j][0]),abs(l[i][1]-l[j][1])] dis[i][j] [i] dis i j [(l[i][0]-l[j][0]),abs(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 abs(l[i][1]-l[j][1]) abs l[i][1]-l[j][1] l[i][1] [i] l i 1 l[j][1] [j] l j 1 temp=0 temp 0 for i in range(N-1):
    for item in dis[i]:
        if item!=0:
            temp=max(sum(x.count(item) for x in dis),temp)

#print(l)
#print(dis) i range(N-1) range N-1 N 1 for item in dis[i]:
        if item!=0:
            temp=max(sum(x.count(item) for x in dis),temp)

#print(l)
#print(dis) item dis[i] dis i if item!=0:
            temp=max(sum(x.count(item) for x in dis),temp)

#print(l)
#print(dis) item!=0 item 0 temp=max(sum(x.count(item) for x in dis),temp) temp max(sum(x.count(item) for x in dis),temp) max sum(x.count(item) for x in dis) sum x.count(item) x.count x count item temp print(N-temp) print N-temp N temp dis=[[0]*(N) for i in range(N-1)] [[0]*(N) for i in range(N-1)] dis N=int(input()) int(input()) N temp=0 0 temp temp=max(sum(x.count(item) for x in dis),temp) max(sum(x.count(item) for x in dis),temp) temp l=[] [] l
# coding: utf-8
# Your code here!
N=int(input())

l=[]
for i in range(N):
    l.append(list(map(int,input().split())))

dis=[[0]*(N) for i in range(N-1)]
#print(dis)

for i in range(N-1):
    for j in range(i+1,N):
        if l[i][0]-l[j][0]>0:
            dis[i][j]=[(l[i][0]-l[j][0]),(l[i][1]-l[j][1])]
        elif l[i][0]-l[j][0]<0:
            dis[i][j]=[-(l[i][0]-l[j][0]),-(l[i][1]-l[j][1])]
        else:
            dis[i][j]=[(l[i][0]-l[j][0]),abs(l[i][1]-l[j][1])]

temp=0
for i in range(N-1):
    for item in dis[i]:
        if item!=0:
            temp=max(sum(x.count(item) for x in dis),temp)

#print(l)
#print(dis)
print(N-temp)

