from collections import Counter

N = int(input())
A = [list(map(int, input().split())) for _ in range(N)]

pq = []

for x, y in A:
    for i, j in A:
        if x == i and y == j:
            continue
        pq.append(str(i-x)+str(j-y))

ans = Counter(pq).most_common()

if ans == []:
    print(1)
else:
    print(N - ans[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 A = [list(map(int, input().split())) for _ in range(N)] A [list(map(int, input().split())) for _ in range(N)] pq = [] pq [] for x, y in A:
    for i, j in A:
        if x == i and y == j:
            continue
        pq.append(str(i-x)+str(j-y)) x y A for i, j in A:
        if x == i and y == j:
            continue
        pq.append(str(i-x)+str(j-y)) i j A if x == i and y == j:
            continue
         x == i and y == j x == i x i y == j y j continue pq.append(str(i-x)+str(j-y)) pq.append pq append str(i-x)+str(j-y) str(i-x) str i-x i x str(j-y) str j-y j y ans = Counter(pq).most_common() ans Counter(pq).most_common() (pq).most_common (pq) Counter pq most_common if ans == []:
    print(1)
else:
    print(N - ans[0][1]) ans == [] ans [] print(1) print 1 print(N - ans[0][1]) print N - ans[0][1] N ans[0][1] [0] ans 0 1 A = [list(map(int, input().split())) for _ in range(N)] [list(map(int, input().split())) for _ in range(N)] A ans = Counter(pq).most_common() Counter(pq).most_common() ans pq = [] [] pq N = int(input()) int(input()) N
from collections import Counter

N = int(input())
A = [list(map(int, input().split())) for _ in range(N)]

pq = []

for x, y in A:
    for i, j in A:
        if x == i and y == j:
            continue
        pq.append(str(i-x)+str(j-y))

ans = Counter(pq).most_common()

if ans == []:
    print(1)
else:
    print(N - ans[0][1])