n=int(input())
xy=[tuple(map(int,input().split())) for _ in range(n)]
pq=[]
for i in range(n):
    for j in range(n):
        if i==j:
            continue
        sx,sy=xy[i]
        gx,gy=xy[j]
        pq.append((gx-sx,gy-sy))



ans=n
for p,q in pq:
    now=0
    for x,y in xy:
        if (x+p,y+q) not in xy:
            now+=1
    ans=min(ans,now)

print(ans) n=int(input()) n int(input()) int input() input tuple(map(int,input().split())) for _ in range(n) for _ in range(n) _ range(n) range n for _ in range(n) tuple(map(int,input().split())) tuple map(int,input().split()) map int input().split() ().split () input split xy=[tuple(map(int,input().split())) for _ in range(n)] xy [tuple(map(int,input().split())) for _ in range(n)] pq=[] pq [] for i in range(n):
    for j in range(n):
        if i==j:
            continue
        sx,sy=xy[i]
        gx,gy=xy[j]
        pq.append((gx-sx,gy-sy)) i range(n) range n for j in range(n):
        if i==j:
            continue
        sx,sy=xy[i]
        gx,gy=xy[j]
        pq.append((gx-sx,gy-sy)) j range(n) range n if i==j:
            continue
         i==j i j continue sx,sy=xy[i] sx xy[i] xy i sy gx,gy=xy[j] gx xy[j] xy j gy pq.append((gx-sx,gy-sy)) pq.append pq append (gx-sx,gy-sy) gx-sx gx sx gy-sy gy sy ans=n ans n for p,q in pq:
    now=0
    for x,y in xy:
        if (x+p,y+q) not in xy:
            now+=1
    ans=min(ans,now) p q pq now=0 now 0 for x,y in xy:
        if (x+p,y+q) not in xy:
            now+=1
     x y xy if (x+p,y+q) not in xy:
            now+=1
     (x+p,y+q) not in xy (x+p,y+q) x+p x p y+q y q xy now+=1 now 1 ans=min(ans,now) ans min(ans,now) min ans now print(ans) print ans now=0 0 now sx,sy=xy[i] xy[i] sx gx,gy=xy[j] xy[j] gx ans=n n ans pq=[] [] pq sy=xy[i] xy[i] sy gy=xy[j] xy[j] gy ans=min(ans,now) min(ans,now) ans xy=[tuple(map(int,input().split())) for _ in range(n)] [tuple(map(int,input().split())) for _ in range(n)] xy now+=1 1 now n=int(input()) int(input()) n
n=int(input())
xy=[tuple(map(int,input().split())) for _ in range(n)]
pq=[]
for i in range(n):
    for j in range(n):
        if i==j:
            continue
        sx,sy=xy[i]
        gx,gy=xy[j]
        pq.append((gx-sx,gy-sy))



ans=n
for p,q in pq:
    now=0
    for x,y in xy:
        if (x+p,y+q) not in xy:
            now+=1
    ans=min(ans,now)

print(ans)
