import math

n=int(input())

XY=[]

for i in range(n):
    x,y=map(int,input().split())
    XY.append([x,y])

v=[]

for i in range(n):
    for j in range(n):
        if j!=i:
            v.append([XY[i][0]-XY[j][0],XY[i][1]-XY[j][1]])


c=0
for vx,vy in v:
    cv=0
    for i in range(n):
        for j in range(n):
            if j!=i and [XY[i][0]-XY[j][0],XY[i][1]-XY[j][1]]==[vx,vy]:
                cv+=1
    c=max(cv,c)

print(n-c) import math math n=int(input()) n int(input()) int input() input XY=[] XY [] for i in range(n):
    x,y=map(int,input().split())
    XY.append([x,y]) i range(n) range n x,y=map(int,input().split()) x map(int,input().split()) map int input().split() ().split () input split y XY.append([x,y]) XY.append XY append [x,y] x y v=[] v [] for i in range(n):
    for j in range(n):
        if j!=i:
            v.append([XY[i][0]-XY[j][0],XY[i][1]-XY[j][1]]) i range(n) range n for j in range(n):
        if j!=i:
            v.append([XY[i][0]-XY[j][0],XY[i][1]-XY[j][1]]) j range(n) range n if j!=i:
            v.append([XY[i][0]-XY[j][0],XY[i][1]-XY[j][1]]) j!=i j i v.append([XY[i][0]-XY[j][0],XY[i][1]-XY[j][1]]) v.append v 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 c=0 c 0 for vx,vy in v:
    cv=0
    for i in range(n):
        for j in range(n):
            if j!=i and [XY[i][0]-XY[j][0],XY[i][1]-XY[j][1]]==[vx,vy]:
                cv+=1
    c=max(cv,c) vx vy v cv=0 cv 0 for i in range(n):
        for j in range(n):
            if j!=i and [XY[i][0]-XY[j][0],XY[i][1]-XY[j][1]]==[vx,vy]:
                cv+=1
     i range(n) range n for j in range(n):
            if j!=i and [XY[i][0]-XY[j][0],XY[i][1]-XY[j][1]]==[vx,vy]:
                cv+=1
     j range(n) range n if j!=i and [XY[i][0]-XY[j][0],XY[i][1]-XY[j][1]]==[vx,vy]:
                cv+=1
     j!=i and [XY[i][0]-XY[j][0],XY[i][1]-XY[j][1]]==[vx,vy] j!=i j i [XY[i][0]-XY[j][0],XY[i][1]-XY[j][1]]==[vx,vy] [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 [vx,vy] vx vy cv+=1 cv 1 c=max(cv,c) c max(cv,c) max cv c print(n-c) print n-c n c cv=0 0 cv cv+=1 1 cv c=0 0 c x,y=map(int,input().split()) map(int,input().split()) x y=map(int,input().split()) map(int,input().split()) y v=[] [] v c=max(cv,c) max(cv,c) c n=int(input()) int(input()) n XY=[] [] XY
import math

n=int(input())

XY=[]

for i in range(n):
    x,y=map(int,input().split())
    XY.append([x,y])

v=[]

for i in range(n):
    for j in range(n):
        if j!=i:
            v.append([XY[i][0]-XY[j][0],XY[i][1]-XY[j][1]])


c=0
for vx,vy in v:
    cv=0
    for i in range(n):
        for j in range(n):
            if j!=i and [XY[i][0]-XY[j][0],XY[i][1]-XY[j][1]]==[vx,vy]:
                cv+=1
    c=max(cv,c)

print(n-c)