from itertools import permutations
from collections import Counter

N,*xyf = map(int, open(0).read().split())
xy = [(xyf[i*2],xyf[i*2+1]) for i in range(N)]
if N == 1:
    print(1)
else:
    count = []
    for a, b in permutations(xy,2):
        count.append((b[0]-a[0],b[1]-a[1]))
    c = Counter(count)
    print(N-max(c.values())) from itertools import permutations from collections import Counter N,*xyf = map(int, open(0).read().split()) N map(int, open(0).read().split()) map int open(0).read().split() (0).read().split (0).read() (0).read (0) open 0 read split *xyf xyf (xyf[i*2],xyf[i*2+1]) for i in range(N) for i in range(N) i range(N) range N for i in range(N) (xyf[i*2],xyf[i*2+1]) xyf[i*2] xyf i*2 i 2 xyf[i*2+1] xyf i*2+1 i*2 i 2 1 xy = [(xyf[i*2],xyf[i*2+1]) for i in range(N)] xy [(xyf[i*2],xyf[i*2+1]) for i in range(N)] if N == 1:
    print(1)
else:
    count = []
    for a, b in permutations(xy,2):
        count.append((b[0]-a[0],b[1]-a[1]))
    c = Counter(count)
    print(N-max(c.values())) N == 1 N 1 print(1) print 1 count = [] count [] for a, b in permutations(xy,2):
        count.append((b[0]-a[0],b[1]-a[1]))
     a b permutations(xy,2) permutations xy 2 count.append((b[0]-a[0],b[1]-a[1])) count.append count append (b[0]-a[0],b[1]-a[1]) b[0]-a[0] b[0] b 0 a[0] a 0 b[1]-a[1] b[1] b 1 a[1] a 1 c = Counter(count) c Counter(count) Counter count print(N-max(c.values())) print N-max(c.values()) N max(c.values()) max c.values() c.values c values xy = [(xyf[i*2],xyf[i*2+1]) for i in range(N)] [(xyf[i*2],xyf[i*2+1]) for i in range(N)] xy c = Counter(count) Counter(count) c N,*xyf = map(int, open(0).read().split()) map(int, open(0).read().split()) N count = [] [] count
from itertools import permutations
from collections import Counter

N,*xyf = map(int, open(0).read().split())
xy = [(xyf[i*2],xyf[i*2+1]) for i in range(N)]
if N == 1:
    print(1)
else:
    count = []
    for a, b in permutations(xy,2):
        count.append((b[0]-a[0],b[1]-a[1]))
    c = Counter(count)
    print(N-max(c.values()))