n = int(input())
ans = n
L = [list(map(int, input().split())) for _ in range(n)]
pq = []
for i in range(n):
    for j in range(i+1, n):
        pq.append([L[j][0] - L[i][0], L[j][1] - L[i][1]])
for p, q in pq:
    cost = n
    for x, y in L:
        if [x-p, y-q] in L:
            cost -=1
    ans = min(ans, cost)
print(ans) n = int(input()) n int(input()) int input() input ans = n ans n 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 L = [list(map(int, input().split())) for _ in range(n)] L [list(map(int, input().split())) for _ in range(n)] pq = [] pq [] for i in range(n):
    for j in range(i+1, n):
        pq.append([L[j][0] - L[i][0], L[j][1] - L[i][1]]) i range(n) range n for j in range(i+1, n):
        pq.append([L[j][0] - L[i][0], L[j][1] - L[i][1]]) j range(i+1, n) range i+1 i 1 n pq.append([L[j][0] - L[i][0], L[j][1] - L[i][1]]) pq.append pq append [L[j][0] - L[i][0], L[j][1] - L[i][1]] L[j][0] - L[i][0] L[j][0] [j] L j 0 L[i][0] [i] L i 0 L[j][1] - L[i][1] L[j][1] [j] L j 1 L[i][1] [i] L i 1 for p, q in pq:
    cost = n
    for x, y in L:
        if [x-p, y-q] in L:
            cost -=1
    ans = min(ans, cost) p q pq cost = n cost n for x, y in L:
        if [x-p, y-q] in L:
            cost -=1
     x y L if [x-p, y-q] in L:
            cost -=1
     [x-p, y-q] in L [x-p, y-q] x-p x p y-q y q L cost -=1 cost 1 ans = min(ans, cost) ans min(ans, cost) min ans cost print(ans) print ans n = int(input()) int(input()) n L = [list(map(int, input().split())) for _ in range(n)] [list(map(int, input().split())) for _ in range(n)] L pq = [] [] pq cost -=1 1 cost ans = n n ans ans = min(ans, cost) min(ans, cost) ans cost = n n cost
n = int(input())
ans = n
L = [list(map(int, input().split())) for _ in range(n)]
pq = []
for i in range(n):
    for j in range(i+1, n):
        pq.append([L[j][0] - L[i][0], L[j][1] - L[i][1]])
for p, q in pq:
    cost = n
    for x, y in L:
        if [x-p, y-q] in L:
            cost -=1
    ans = min(ans, cost)
print(ans)
