n = int(input())
s = [list(map(int, input().split())) for _ in range(n)]
t = []
for i in range(n):
    for j in range(n):
        if not i == j:
            t.append([s[i][0] - s[j][0], s[i][1] - s[j][1]])
ans = n
for i in range(pow(n, 2) - n):
    cnt = 0
    for j in range(pow(n, 2) - n):
        if t[i][0] == t[j][0] and t[i][1] == t[j][1]:
            cnt += 1
    ans = min(ans, n - cnt)
print(ans) 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 s = [list(map(int, input().split())) for _ in range(n)] s [list(map(int, input().split())) for _ in range(n)] t = [] t [] for i in range(n):
    for j in range(n):
        if not i == j:
            t.append([s[i][0] - s[j][0], s[i][1] - s[j][1]]) i range(n) range n for j in range(n):
        if not i == j:
            t.append([s[i][0] - s[j][0], s[i][1] - s[j][1]]) j range(n) range n if not i == j:
            t.append([s[i][0] - s[j][0], s[i][1] - s[j][1]]) not i == j i == j i j t.append([s[i][0] - s[j][0], s[i][1] - s[j][1]]) t.append t append [s[i][0] - s[j][0], s[i][1] - s[j][1]] s[i][0] - s[j][0] s[i][0] [i] s i 0 s[j][0] [j] s j 0 s[i][1] - s[j][1] s[i][1] [i] s i 1 s[j][1] [j] s j 1 ans = n ans n for i in range(pow(n, 2) - n):
    cnt = 0
    for j in range(pow(n, 2) - n):
        if t[i][0] == t[j][0] and t[i][1] == t[j][1]:
            cnt += 1
    ans = min(ans, n - cnt) i range(pow(n, 2) - n) range pow(n, 2) - n pow(n, 2) pow n 2 n cnt = 0 cnt 0 for j in range(pow(n, 2) - n):
        if t[i][0] == t[j][0] and t[i][1] == t[j][1]:
            cnt += 1
     j range(pow(n, 2) - n) range pow(n, 2) - n pow(n, 2) pow n 2 n if t[i][0] == t[j][0] and t[i][1] == t[j][1]:
            cnt += 1
     t[i][0] == t[j][0] and t[i][1] == t[j][1] t[i][0] == t[j][0] t[i][0] [i] t i 0 t[j][0] [j] t j 0 t[i][1] == t[j][1] t[i][1] [i] t i 1 t[j][1] [j] t j 1 cnt += 1 cnt 1 ans = min(ans, n - cnt) ans min(ans, n - cnt) min ans n - cnt n cnt print(ans) print ans ans = min(ans, n - cnt) min(ans, n - cnt) ans cnt += 1 1 cnt n = int(input()) int(input()) n t = [] [] t cnt = 0 0 cnt ans = n n ans s = [list(map(int, input().split())) for _ in range(n)] [list(map(int, input().split())) for _ in range(n)] s
n = int(input())
s = [list(map(int, input().split())) for _ in range(n)]
t = []
for i in range(n):
    for j in range(n):
        if not i == j:
            t.append([s[i][0] - s[j][0], s[i][1] - s[j][1]])
ans = n
for i in range(pow(n, 2) - n):
    cnt = 0
    for j in range(pow(n, 2) - n):
        if t[i][0] == t[j][0] and t[i][1] == t[j][1]:
            cnt += 1
    ans = min(ans, n - cnt)
print(ans)