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