

N = int(input())
xy = [tuple(map(int, input().split())) for _ in range(N)]

pq = []
for i in range(N):
    for j in range(N):
        if i != j:
            pq.append((xy[i][0] - xy[j][0], xy[i][1] - xy[j][1]))


ans = N
for p,q in pq:
    cost = 0
    for x,y in xy:
        if  (x+p, y+q) not in xy:
            cost += 1

    ans = min(ans, cost)

print(ans) N = int(input()) N int(input()) int input() input tuple(map(int, input().split())) for _ in range(N) for _ in range(N) _ range(N) range N for _ in range(N) tuple(map(int, input().split())) tuple map(int, input().split()) map int input().split() ().split () input split xy = [tuple(map(int, input().split())) for _ in range(N)] xy [tuple(map(int, input().split())) for _ in range(N)] pq = [] pq [] for i in range(N):
    for j in range(N):
        if i != j:
            pq.append((xy[i][0] - xy[j][0], xy[i][1] - xy[j][1])) i range(N) range N for j in range(N):
        if i != j:
            pq.append((xy[i][0] - xy[j][0], xy[i][1] - xy[j][1])) j range(N) range N if i != j:
            pq.append((xy[i][0] - xy[j][0], xy[i][1] - xy[j][1])) i != j i j pq.append((xy[i][0] - xy[j][0], xy[i][1] - xy[j][1])) pq.append pq append (xy[i][0] - xy[j][0], xy[i][1] - xy[j][1]) xy[i][0] - xy[j][0] xy[i][0] [i] xy i 0 xy[j][0] [j] xy j 0 xy[i][1] - xy[j][1] xy[i][1] [i] xy i 1 xy[j][1] [j] xy j 1 ans = N ans N for p,q in pq:
    cost = 0
    for x,y in xy:
        if  (x+p, y+q) not in xy:
            cost += 1

    ans = min(ans, cost) p q pq cost = 0 cost 0 for x,y in xy:
        if  (x+p, y+q) not in xy:
            cost += 1

     x y xy if  (x+p, y+q) not in xy:
            cost += 1

     (x+p, y+q) not in xy (x+p, y+q) x+p x p y+q y q xy cost += 1 cost 1 ans = min(ans, cost) ans min(ans, cost) min ans cost print(ans) print ans ans = min(ans, cost) min(ans, cost) ans N = int(input()) int(input()) N pq = [] [] pq cost = 0 0 cost cost += 1 1 cost ans = N N ans xy = [tuple(map(int, input().split())) for _ in range(N)] [tuple(map(int, input().split())) for _ in range(N)] xy


N = int(input())
xy = [tuple(map(int, input().split())) for _ in range(N)]

pq = []
for i in range(N):
    for j in range(N):
        if i != j:
            pq.append((xy[i][0] - xy[j][0], xy[i][1] - xy[j][1]))


ans = N
for p,q in pq:
    cost = 0
    for x,y in xy:
        if  (x+p, y+q) not in xy:
            cost += 1

    ans = min(ans, cost)

print(ans)