n=int(input())
M=[]
for i in range(n):
    x,y=map(int,input().split())
    M.append([x,y])
M.sort(key=lambda x:(x[0],x[1]))
X=[]
Y=[]
for i in range(n-1):
    for j in range(i+1,n):
        a=M[i][0]-M[j][0]
        b=M[i][1]-M[j][1]
        if not [a,b] in Y:
            Y.append([a,b])
            X.append(1)
        else:
            X[Y.index([a,b])]+=1
ans=n
for i in range(len(Y)):
    ans=min(ans,n-X[i])
print(ans) n=int(input()) n int(input()) int input() input M=[] M [] for i in range(n):
    x,y=map(int,input().split())
    M.append([x,y]) i range(n) range n x,y=map(int,input().split()) x map(int,input().split()) map int input().split() ().split () input split y M.append([x,y]) M.append M append [x,y] x y M.sort(key=lambda x:(x[0],x[1])) M.sort M sort key=lambda x:(x[0],x[1]) key lambda x:(x[0],x[1]) (x[0],x[1]) x[0] x 0 x[1] x 1 x X=[] X [] Y=[] Y [] for i in range(n-1):
    for j in range(i+1,n):
        a=M[i][0]-M[j][0]
        b=M[i][1]-M[j][1]
        if not [a,b] in Y:
            Y.append([a,b])
            X.append(1)
        else:
            X[Y.index([a,b])]+=1 i range(n-1) range n-1 n 1 for j in range(i+1,n):
        a=M[i][0]-M[j][0]
        b=M[i][1]-M[j][1]
        if not [a,b] in Y:
            Y.append([a,b])
            X.append(1)
        else:
            X[Y.index([a,b])]+=1 j range(i+1,n) range i+1 i 1 n a=M[i][0]-M[j][0] a M[i][0]-M[j][0] M[i][0] [i] M i 0 M[j][0] [j] M j 0 b=M[i][1]-M[j][1] b M[i][1]-M[j][1] M[i][1] [i] M i 1 M[j][1] [j] M j 1 if not [a,b] in Y:
            Y.append([a,b])
            X.append(1)
        else:
            X[Y.index([a,b])]+=1 not [a,b] in Y [a,b] in Y [a,b] a b Y Y.append([a,b]) Y.append Y append [a,b] a b X.append(1) X.append X append 1 X[Y.index([a,b])]+=1 X[Y.index([a,b])] X Y.index([a,b]) Y.index Y index [a,b] a b 1 ans=n ans n for i in range(len(Y)):
    ans=min(ans,n-X[i]) i range(len(Y)) range len(Y) len Y ans=min(ans,n-X[i]) ans min(ans,n-X[i]) min ans n-X[i] n X[i] X i print(ans) print ans a=M[i][0]-M[j][0] M[i][0]-M[j][0] a n=int(input()) int(input()) n Y=[] [] Y ans=min(ans,n-X[i]) min(ans,n-X[i]) ans ans=n n ans x,y=map(int,input().split()) map(int,input().split()) x X=[] [] X b=M[i][1]-M[j][1] M[i][1]-M[j][1] b M=[] [] M y=map(int,input().split()) map(int,input().split()) y
n=int(input())
M=[]
for i in range(n):
    x,y=map(int,input().split())
    M.append([x,y])
M.sort(key=lambda x:(x[0],x[1]))
X=[]
Y=[]
for i in range(n-1):
    for j in range(i+1,n):
        a=M[i][0]-M[j][0]
        b=M[i][1]-M[j][1]
        if not [a,b] in Y:
            Y.append([a,b])
            X.append(1)
        else:
            X[Y.index([a,b])]+=1
ans=n
for i in range(len(Y)):
    ans=min(ans,n-X[i])
print(ans)