from collections import Counter
N = int(input())
X = []
for i in range(N):
    x,y = map(int,input().split())
    X.append((x,y))
kouho = []
for i in range(N):
    for j in range(N):
        if i==j:continue
        kouho.append((X[i][0]-X[j][0],X[i][1]-X[j][1]))
C = Counter(kouho)
if len(C)==0:print(1)
else:print(N-max(C.values())) from collections import Counter N = int(input()) N int(input()) int input() input X = [] X [] for i in range(N):
    x,y = map(int,input().split())
    X.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 X.append((x,y)) X.append X append (x,y) x y kouho = [] kouho [] for i in range(N):
    for j in range(N):
        if i==j:continue
        kouho.append((X[i][0]-X[j][0],X[i][1]-X[j][1])) i range(N) range N for j in range(N):
        if i==j:continue
        kouho.append((X[i][0]-X[j][0],X[i][1]-X[j][1])) j range(N) range N if i==j:continue
         i==j i j kouho.append((X[i][0]-X[j][0],X[i][1]-X[j][1])) kouho.append kouho append (X[i][0]-X[j][0],X[i][1]-X[j][1]) X[i][0]-X[j][0] X[i][0] [i] X i 0 X[j][0] [j] X j 0 X[i][1]-X[j][1] X[i][1] [i] X i 1 X[j][1] [j] X j 1 C = Counter(kouho) C Counter(kouho) Counter kouho if len(C)==0:print(1)
else:print(N-max(C.values())) len(C)==0 len(C) len C 0 y = map(int,input().split()) map(int,input().split()) y N = int(input()) int(input()) N kouho = [] [] kouho C = Counter(kouho) Counter(kouho) C x,y = map(int,input().split()) map(int,input().split()) x X = [] [] X
from collections import Counter
N = int(input())
X = []
for i in range(N):
    x,y = map(int,input().split())
    X.append((x,y))
kouho = []
for i in range(N):
    for j in range(N):
        if i==j:continue
        kouho.append((X[i][0]-X[j][0],X[i][1]-X[j][1]))
C = Counter(kouho)
if len(C)==0:print(1)
else:print(N-max(C.values()))