from collections import Counter
N = int(input())
X = []
for _ in range(N):
  X.append(list(map(int, input().split())))
  
if N == 1:
  print(1)
  exit(0)
A = []
for i in range(N):
  for j in range(N):
    if i==j:
      continue
    A.append((X[i][0]-X[j][0], X[i][1]-X[j][1]))
    
C = Counter(A)
print(N - C.most_common()[0][1]) from collections import Counter N = int(input()) N int(input()) int input() input X = [] X [] for _ in range(N):
  X.append(list(map(int, input().split())))
   _ range(N) range N X.append(list(map(int, input().split()))) X.append X append list(map(int, input().split())) list map(int, input().split()) map int input().split() ().split () input split if N == 1:
  print(1)
  exit(0) N == 1 N 1 print(1) print 1 exit(0) exit 0 A = [] A [] for i in range(N):
  for j in range(N):
    if i==j:
      continue
    A.append((X[i][0]-X[j][0], X[i][1]-X[j][1]))
     i range(N) range N for j in range(N):
    if i==j:
      continue
    A.append((X[i][0]-X[j][0], X[i][1]-X[j][1]))
     j range(N) range N if i==j:
      continue
     i==j i j continue A.append((X[i][0]-X[j][0], X[i][1]-X[j][1])) A.append A append (X[i][0]-X[j][0], X[i][1]-X[j][1]) X[i][0]-X[j][0] X[i][0] [i] X i 0 X[j][0] [j] X j 0 X[i][1]-X[j][1] X[i][1] [i] X i 1 X[j][1] [j] X j 1 C = Counter(A) C Counter(A) Counter A print(N - C.most_common()[0][1]) print N - C.most_common()[0][1] N C.most_common()[0][1] [0] C.most_common() C.most_common C most_common 0 1 A = [] [] A C = Counter(A) Counter(A) C N = int(input()) int(input()) N X = [] [] X
from collections import Counter
N = int(input())
X = []
for _ in range(N):
  X.append(list(map(int, input().split())))
  
if N == 1:
  print(1)
  exit(0)
A = []
for i in range(N):
  for j in range(N):
    if i==j:
      continue
    A.append((X[i][0]-X[j][0], X[i][1]-X[j][1]))
    
C = Counter(A)
print(N - C.most_common()[0][1])