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