import collections
import sys

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

if N == 1:
    print(1)
    sys.exit()

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]))
#print(pq)
pqc = collections.Counter(pq)
x = pqc.most_common()[0][1]
print(N-x) import collections collections import sys sys 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)] if N == 1:
    print(1)
    sys.exit() N == 1 N 1 print(1) print 1 sys.exit() sys.exit sys exit 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]))
#print(pq) 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]))
#print(pq) j range(N) range N if i != j:
            pq.append((xy[i][0]-xy[j][0], xy[i][1]-xy[j][1]))
#print(pq) 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 pqc = collections.Counter(pq) pqc collections.Counter(pq) collections.Counter collections Counter pq x = pqc.most_common()[0][1] x pqc.most_common()[0][1] [0] pqc.most_common() pqc.most_common pqc most_common 0 1 print(N-x) print N-x N x pqc = collections.Counter(pq) collections.Counter(pq) pqc N = int(input()) int(input()) N xy = [list(map(int,input().split())) for i in range(N)] [list(map(int,input().split())) for i in range(N)] xy x = pqc.most_common()[0][1] pqc.most_common()[0][1] x pq = [] [] pq
import collections
import sys

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

if N == 1:
    print(1)
    sys.exit()

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]))
#print(pq)
pqc = collections.Counter(pq)
x = pqc.most_common()[0][1]
print(N-x)
