import sys
from collections import Counter

readline = sys.stdin.readline
n = int(readline())
xy = [list(map(int, readline().split())) for _ in range(n)]

d = []
for i in range(n-1):
    for j in range(i+1, n):
        p = xy[i][0] - xy[j][0]
        q = xy[i][1] - xy[j][1]
        d.append((p, q))
        d.append((-p, -q))

if n > 1:
    ans = n - max(Counter(d).values())
else:
    ans = 1

print(ans) import sys sys from collections import Counter readline = sys.stdin.readline readline sys.stdin.readline sys.stdin sys stdin readline n = int(readline()) n int(readline()) int readline() readline list(map(int, readline().split())) for _ in range(n) for _ in range(n) _ range(n) range n for _ in range(n) list(map(int, readline().split())) list map(int, readline().split()) map int readline().split() ().split () readline split xy = [list(map(int, readline().split())) for _ in range(n)] xy [list(map(int, readline().split())) for _ in range(n)] d = [] d [] for i in range(n-1):
    for j in range(i+1, n):
        p = xy[i][0] - xy[j][0]
        q = xy[i][1] - xy[j][1]
        d.append((p, q))
        d.append((-p, -q)) i range(n-1) range n-1 n 1 for j in range(i+1, n):
        p = xy[i][0] - xy[j][0]
        q = xy[i][1] - xy[j][1]
        d.append((p, q))
        d.append((-p, -q)) j range(i+1, n) range i+1 i 1 n p = xy[i][0] - xy[j][0] p xy[i][0] - xy[j][0] xy[i][0] [i] xy i 0 xy[j][0] [j] xy j 0 q = xy[i][1] - xy[j][1] q xy[i][1] - xy[j][1] xy[i][1] [i] xy i 1 xy[j][1] [j] xy j 1 d.append((p, q)) d.append d append (p, q) p q d.append((-p, -q)) d.append d append (-p, -q) -p p -q q if n > 1:
    ans = n - max(Counter(d).values())
else:
    ans = 1 n > 1 n 1 ans = n - max(Counter(d).values()) ans n - max(Counter(d).values()) n max(Counter(d).values()) max Counter(d).values() (d).values (d) Counter d values ans = 1 ans 1 print(ans) print ans n = int(readline()) int(readline()) n xy = [list(map(int, readline().split())) for _ in range(n)] [list(map(int, readline().split())) for _ in range(n)] xy p = xy[i][0] - xy[j][0] xy[i][0] - xy[j][0] p q = xy[i][1] - xy[j][1] xy[i][1] - xy[j][1] q ans = 1 1 ans d = [] [] d readline = sys.stdin.readline sys.stdin.readline readline ans = n - max(Counter(d).values()) n - max(Counter(d).values()) ans
import sys
from collections import Counter

readline = sys.stdin.readline
n = int(readline())
xy = [list(map(int, readline().split())) for _ in range(n)]

d = []
for i in range(n-1):
    for j in range(i+1, n):
        p = xy[i][0] - xy[j][0]
        q = xy[i][1] - xy[j][1]
        d.append((p, q))
        d.append((-p, -q))

if n > 1:
    ans = n - max(Counter(d).values())
else:
    ans = 1

print(ans)
