from collections import Counter
n = int(input())
XY = [list(map(int,input().split())) for _ in range(n)]
dXY = Counter([])
for i in range(n):
    for j in range(n):
        if i!=j:
            dXY += Counter([str(XY[i][0]-XY[j][0])+'_'+str(XY[i][1]-XY[j][1])])
if n==1:
    print(1)
else:
    print(n-dXY.most_common()[0][1]) from collections import Counter n = int(input()) n int(input()) int input() input list(map(int,input().split())) for _ in range(n) for _ in range(n) _ range(n) range n for _ in range(n) list(map(int,input().split())) list map(int,input().split()) map int input().split() ().split () input split XY = [list(map(int,input().split())) for _ in range(n)] XY [list(map(int,input().split())) for _ in range(n)] dXY = Counter([]) dXY Counter([]) Counter [] for i in range(n):
    for j in range(n):
        if i!=j:
            dXY += Counter([str(XY[i][0]-XY[j][0])+'_'+str(XY[i][1]-XY[j][1])]) i range(n) range n for j in range(n):
        if i!=j:
            dXY += Counter([str(XY[i][0]-XY[j][0])+'_'+str(XY[i][1]-XY[j][1])]) j range(n) range n if i!=j:
            dXY += Counter([str(XY[i][0]-XY[j][0])+'_'+str(XY[i][1]-XY[j][1])]) i!=j i j dXY += Counter([str(XY[i][0]-XY[j][0])+'_'+str(XY[i][1]-XY[j][1])]) dXY Counter([str(XY[i][0]-XY[j][0])+'_'+str(XY[i][1]-XY[j][1])]) Counter [str(XY[i][0]-XY[j][0])+'_'+str(XY[i][1]-XY[j][1])] str(XY[i][0]-XY[j][0])+'_'+str(XY[i][1]-XY[j][1]) str(XY[i][0]-XY[j][0])+'_' str(XY[i][0]-XY[j][0]) str XY[i][0]-XY[j][0] XY[i][0] [i] XY i 0 XY[j][0] [j] XY j 0 '_' str(XY[i][1]-XY[j][1]) str XY[i][1]-XY[j][1] XY[i][1] [i] XY i 1 XY[j][1] [j] XY j 1 if n==1:
    print(1)
else:
    print(n-dXY.most_common()[0][1]) n==1 n 1 print(1) print 1 print(n-dXY.most_common()[0][1]) print n-dXY.most_common()[0][1] n dXY.most_common()[0][1] [0] dXY.most_common() dXY.most_common dXY most_common 0 1 n = int(input()) int(input()) n XY = [list(map(int,input().split())) for _ in range(n)] [list(map(int,input().split())) for _ in range(n)] XY dXY += Counter([str(XY[i][0]-XY[j][0])+'_'+str(XY[i][1]-XY[j][1])]) Counter([str(XY[i][0]-XY[j][0])+'_'+str(XY[i][1]-XY[j][1])]) dXY dXY = Counter([]) Counter([]) dXY
from collections import Counter
n = int(input())
XY = [list(map(int,input().split())) for _ in range(n)]
dXY = Counter([])
for i in range(n):
    for j in range(n):
        if i!=j:
            dXY += Counter([str(XY[i][0]-XY[j][0])+'_'+str(XY[i][1]-XY[j][1])])
if n==1:
    print(1)
else:
    print(n-dXY.most_common()[0][1])