N = int(input())
coord = []
for _ in range(N):
    x, y = map(int, input().split(" "))
    coord.append((x, y))

ans = N

for k in range(N):
    for l in range(N):
        if k == l:
            continue
        p, q = coord[k][0] - coord[l][0], coord[k][1] - coord[l][1]
        tmp = N
        for i in range(N):
            for j in range(N):
                if coord[i][0] - p == coord[j][0] and coord[i][1] - q == coord[j][1]:
                    tmp -= 1
        ans = min(ans, tmp)

print(ans) N = int(input()) N int(input()) int input() input coord = [] coord [] for _ in range(N):
    x, y = map(int, input().split(" "))
    coord.append((x, y)) _ range(N) range N x, y = map(int, input().split(" ")) x map(int, input().split(" ")) map int input().split(" ") ().split () input split " " y coord.append((x, y)) coord.append coord append (x, y) x y ans = N ans N for k in range(N):
    for l in range(N):
        if k == l:
            continue
        p, q = coord[k][0] - coord[l][0], coord[k][1] - coord[l][1]
        tmp = N
        for i in range(N):
            for j in range(N):
                if coord[i][0] - p == coord[j][0] and coord[i][1] - q == coord[j][1]:
                    tmp -= 1
        ans = min(ans, tmp) k range(N) range N for l in range(N):
        if k == l:
            continue
        p, q = coord[k][0] - coord[l][0], coord[k][1] - coord[l][1]
        tmp = N
        for i in range(N):
            for j in range(N):
                if coord[i][0] - p == coord[j][0] and coord[i][1] - q == coord[j][1]:
                    tmp -= 1
        ans = min(ans, tmp) l range(N) range N if k == l:
            continue
         k == l k l continue p, q = coord[k][0] - coord[l][0], coord[k][1] - coord[l][1] p coord[k][0] - coord[l][0] coord[k][0] [k] coord k 0 coord[l][0] [l] coord l 0 q coord[k][1] - coord[l][1] coord[k][1] [k] coord k 1 coord[l][1] [l] coord l 1 tmp = N tmp N for i in range(N):
            for j in range(N):
                if coord[i][0] - p == coord[j][0] and coord[i][1] - q == coord[j][1]:
                    tmp -= 1
         i range(N) range N for j in range(N):
                if coord[i][0] - p == coord[j][0] and coord[i][1] - q == coord[j][1]:
                    tmp -= 1
         j range(N) range N if coord[i][0] - p == coord[j][0] and coord[i][1] - q == coord[j][1]:
                    tmp -= 1
         coord[i][0] - p == coord[j][0] and coord[i][1] - q == coord[j][1] coord[i][0] - p == coord[j][0] coord[i][0] - p coord[i][0] [i] coord i 0 p coord[j][0] [j] coord j 0 coord[i][1] - q == coord[j][1] coord[i][1] - q coord[i][1] [i] coord i 1 q coord[j][1] [j] coord j 1 tmp -= 1 tmp 1 ans = min(ans, tmp) ans min(ans, tmp) min ans tmp print(ans) print ans ans = N N ans q = coord[k][0] - coord[l][0], coord[k][1] - coord[l][1] coord[k][1] - coord[l][1] q tmp = N N tmp x, y = map(int, input().split(" ")) map(int, input().split(" ")) x N = int(input()) int(input()) N ans = min(ans, tmp) min(ans, tmp) ans tmp -= 1 1 tmp coord = [] [] coord p, q = coord[k][0] - coord[l][0], coord[k][1] - coord[l][1] coord[k][0] - coord[l][0] p y = map(int, input().split(" ")) map(int, input().split(" ")) y
N = int(input())
coord = []
for _ in range(N):
    x, y = map(int, input().split(" "))
    coord.append((x, y))

ans = N

for k in range(N):
    for l in range(N):
        if k == l:
            continue
        p, q = coord[k][0] - coord[l][0], coord[k][1] - coord[l][1]
        tmp = N
        for i in range(N):
            for j in range(N):
                if coord[i][0] - p == coord[j][0] and coord[i][1] - q == coord[j][1]:
                    tmp -= 1
        ans = min(ans, tmp)

print(ans)