from collections import Counter
from itertools import permutations
n=int(input())
if n==1:print(1);exit()
XY=[list(map(int,input().split())) for _ in range(n)]
A=[(X[0]-Y[0],X[1]-Y[1]) for X,Y in permutations(XY,2)]
print(n-max(Counter(A).values())) from collections import Counter from itertools import permutations n=int(input()) n int(input()) int input() input if n==1:print(1);exit() n==1 n 1 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)] (X[0]-Y[0],X[1]-Y[1]) for X,Y in permutations(XY,2) for X,Y in permutations(XY,2) X Y permutations(XY,2) permutations XY 2 for X,Y in permutations(XY,2) (X[0]-Y[0],X[1]-Y[1]) X[0]-Y[0] X[0] X 0 Y[0] Y 0 X[1]-Y[1] X[1] X 1 Y[1] Y 1 A=[(X[0]-Y[0],X[1]-Y[1]) for X,Y in permutations(XY,2)] A [(X[0]-Y[0],X[1]-Y[1]) for X,Y in permutations(XY,2)] print(n-max(Counter(A).values())) print n-max(Counter(A).values()) n max(Counter(A).values()) max Counter(A).values() (A).values (A) Counter A values XY=[list(map(int,input().split())) for _ in range(n)] [list(map(int,input().split())) for _ in range(n)] XY A=[(X[0]-Y[0],X[1]-Y[1]) for X,Y in permutations(XY,2)] [(X[0]-Y[0],X[1]-Y[1]) for X,Y in permutations(XY,2)] A n=int(input()) int(input()) n
from collections import Counter
from itertools import permutations
n=int(input())
if n==1:print(1);exit()
XY=[list(map(int,input().split())) for _ in range(n)]
A=[(X[0]-Y[0],X[1]-Y[1]) for X,Y in permutations(XY,2)]
print(n-max(Counter(A).values()))