n=int(input())
if n==1:
  print(1)
  exit()
l=[list(map(int,input().split())) for _ in range(n)]
d=[]
for i in range(n):
  for j in range(n):
    if i!=j:
      d.append((l[i][0]-l[j][0],l[i][1]-l[j][1]))
from collections import Counter as c
print(n-c(d).most_common()[0][1]) n=int(input()) n int(input()) int input() input if n==1:
  print(1)
  exit() n==1 n 1 print(1) print 1 exit() exit list(map(int,input().split())) for _ in range(n) for _ in range(n) _ range(n) range n for _ in range(n) list(map(int,input().split())) list map(int,input().split()) map int input().split() ().split () input split l=[list(map(int,input().split())) for _ in range(n)] l [list(map(int,input().split())) for _ in range(n)] d=[] d [] for i in range(n):
  for j in range(n):
    if i!=j:
      d.append((l[i][0]-l[j][0],l[i][1]-l[j][1])) i range(n) range n for j in range(n):
    if i!=j:
      d.append((l[i][0]-l[j][0],l[i][1]-l[j][1])) j range(n) range n if i!=j:
      d.append((l[i][0]-l[j][0],l[i][1]-l[j][1])) i!=j i j d.append((l[i][0]-l[j][0],l[i][1]-l[j][1])) d.append d append (l[i][0]-l[j][0],l[i][1]-l[j][1]) l[i][0]-l[j][0] l[i][0] [i] l i 0 l[j][0] [j] l j 0 l[i][1]-l[j][1] l[i][1] [i] l i 1 l[j][1] [j] l j 1 from collections import Counter as c print(n-c(d).most_common()[0][1]) print n-c(d).most_common()[0][1] n c(d).most_common()[0][1] [0] (d).most_common() (d).most_common (d) c d most_common 0 1 l=[list(map(int,input().split())) for _ in range(n)] [list(map(int,input().split())) for _ in range(n)] l d=[] [] d n=int(input()) int(input()) n
n=int(input())
if n==1:
  print(1)
  exit()
l=[list(map(int,input().split())) for _ in range(n)]
d=[]
for i in range(n):
  for j in range(n):
    if i!=j:
      d.append((l[i][0]-l[j][0],l[i][1]-l[j][1]))
from collections import Counter as c
print(n-c(d).most_common()[0][1])