n = int(input())
 
difs = {}
points = []
 
for i in range(n):
    x, y = list(map(int, input().split()))
 
    for j in range(len(points)):
        dif1 = (points[j][0] - x, points[j][1] - y)
        dif2 = (-dif1[0], -dif1[1])
 
        difs[dif1] = 1 if dif1 not in difs else difs[dif1] + 1
        difs[dif2] = 1 if dif2 not in difs else difs[dif2] + 1
 
    points.append((x, y))
 
if n == 1:
    print(1)
else:
    print(n-max(difs.values())) n = int(input()) n int(input()) int input() input difs = {} difs {} points = [] points [] for i in range(n):
    x, y = list(map(int, input().split()))
 
    for j in range(len(points)):
        dif1 = (points[j][0] - x, points[j][1] - y)
        dif2 = (-dif1[0], -dif1[1])
 
        difs[dif1] = 1 if dif1 not in difs else difs[dif1] + 1
        difs[dif2] = 1 if dif2 not in difs else difs[dif2] + 1
 
    points.append((x, y))
  i range(n) range n x, y = list(map(int, input().split())) x list(map(int, input().split())) list map(int, input().split()) map int input().split() ().split () input split y for j in range(len(points)):
        dif1 = (points[j][0] - x, points[j][1] - y)
        dif2 = (-dif1[0], -dif1[1])
 
        difs[dif1] = 1 if dif1 not in difs else difs[dif1] + 1
        difs[dif2] = 1 if dif2 not in difs else difs[dif2] + 1
 
     j range(len(points)) range len(points) len points dif1 = (points[j][0] - x, points[j][1] - y) dif1 (points[j][0] - x, points[j][1] - y) points[j][0] - x points[j][0] [j] points j 0 x points[j][1] - y points[j][1] [j] points j 1 y dif2 = (-dif1[0], -dif1[1]) dif2 (-dif1[0], -dif1[1]) -dif1[0] dif1[0] dif1 0 -dif1[1] dif1[1] dif1 1 difs[dif1] = 1 if dif1 not in difs else difs[dif1] + 1 difs[dif1] difs dif1 1 if dif1 not in difs else difs[dif1] + 1 dif1 not in difs dif1 difs 1 difs[dif1] + 1 difs[dif1] difs dif1 1 difs[dif2] = 1 if dif2 not in difs else difs[dif2] + 1 difs[dif2] difs dif2 1 if dif2 not in difs else difs[dif2] + 1 dif2 not in difs dif2 difs 1 difs[dif2] + 1 difs[dif2] difs dif2 1 points.append((x, y)) points.append points append (x, y) x y if n == 1:
    print(1)
else:
    print(n-max(difs.values())) n == 1 n 1 print(1) print 1 print(n-max(difs.values())) print n-max(difs.values()) n max(difs.values()) max difs.values() difs.values difs values x, y = list(map(int, input().split())) list(map(int, input().split())) x dif1 = (points[j][0] - x, points[j][1] - y) (points[j][0] - x, points[j][1] - y) dif1 n = int(input()) int(input()) n difs = {} {} difs dif2 = (-dif1[0], -dif1[1]) (-dif1[0], -dif1[1]) dif2 points = [] [] points y = list(map(int, input().split())) list(map(int, input().split())) y
n = int(input())
 
difs = {}
points = []
 
for i in range(n):
    x, y = list(map(int, input().split()))
 
    for j in range(len(points)):
        dif1 = (points[j][0] - x, points[j][1] - y)
        dif2 = (-dif1[0], -dif1[1])
 
        difs[dif1] = 1 if dif1 not in difs else difs[dif1] + 1
        difs[dif2] = 1 if dif2 not in difs else difs[dif2] + 1
 
    points.append((x, y))
 
if n == 1:
    print(1)
else:
    print(n-max(difs.values()))