n = int(input())
xy = [list(map(int, input().split())) for i in range(n)]
cnt = 0
for i in range(n - 1):
    xi, yi = xy[i]
    for j in range(i + 1, n):
        xj, yj = xy[j]
        cost = 0
        for x, y in xy:
            cost += 1 if [x - xj + xi, y - yj + yi] in xy else 0
    cnt = max(cnt, cost)
print(n - cnt) n = int(input()) n int(input()) int input() input list(map(int, input().split())) for i in range(n) for i in range(n) i range(n) range n for i in range(n) list(map(int, input().split())) list map(int, input().split()) map int input().split() ().split () input split xy = [list(map(int, input().split())) for i in range(n)] xy [list(map(int, input().split())) for i in range(n)] cnt = 0 cnt 0 for i in range(n - 1):
    xi, yi = xy[i]
    for j in range(i + 1, n):
        xj, yj = xy[j]
        cost = 0
        for x, y in xy:
            cost += 1 if [x - xj + xi, y - yj + yi] in xy else 0
    cnt = max(cnt, cost) i range(n - 1) range n - 1 n 1 xi, yi = xy[i] xi xy[i] xy i yi for j in range(i + 1, n):
        xj, yj = xy[j]
        cost = 0
        for x, y in xy:
            cost += 1 if [x - xj + xi, y - yj + yi] in xy else 0
     j range(i + 1, n) range i + 1 i 1 n xj, yj = xy[j] xj xy[j] xy j yj cost = 0 cost 0 for x, y in xy:
            cost += 1 if [x - xj + xi, y - yj + yi] in xy else 0
     x y xy cost += 1 if [x - xj + xi, y - yj + yi] in xy else 0 cost 1 if [x - xj + xi, y - yj + yi] in xy else 0 [x - xj + xi, y - yj + yi] in xy [x - xj + xi, y - yj + yi] x - xj + xi x - xj x xj xi y - yj + yi y - yj y yj yi xy 1 0 cnt = max(cnt, cost) cnt max(cnt, cost) max cnt cost print(n - cnt) print n - cnt n cnt xj, yj = xy[j] xy[j] xj cost = 0 0 cost n = int(input()) int(input()) n yj = xy[j] xy[j] yj xi, yi = xy[i] xy[i] xi cnt = 0 0 cnt cnt = max(cnt, cost) max(cnt, cost) cnt xy = [list(map(int, input().split())) for i in range(n)] [list(map(int, input().split())) for i in range(n)] xy yi = xy[i] xy[i] yi cost += 1 if [x - xj + xi, y - yj + yi] in xy else 0 1 if [x - xj + xi, y - yj + yi] in xy else 0 cost
n = int(input())
xy = [list(map(int, input().split())) for i in range(n)]
cnt = 0
for i in range(n - 1):
    xi, yi = xy[i]
    for j in range(i + 1, n):
        xj, yj = xy[j]
        cost = 0
        for x, y in xy:
            cost += 1 if [x - xj + xi, y - yj + yi] in xy else 0
    cnt = max(cnt, cost)
print(n - cnt)