from itertools import combinations
N = int(input())
X = [list(map(int,input().split())) for _ in range(N)]
if N==1:
    print(1)
else:
    C = {}
    for z in combinations(X,2):
        x1,x2 = z
        a = x1[0]-x2[0]
        b = x1[1]-x2[1]
        if a>=0 and b>=0:
            if (a,b) not in C:
                C[(a,b)] = 0
            C[(a,b)] += 1
        elif a>0 and b<0:
            if (a,b) not in C:
                C[(a,b)] = 0
            C[(a,b)] += 1
        elif a==0 and b<0:
            if (a,-b) not in C:
                C[(a,-b)] = 0
            C[(a,-b)] += 1
        elif a<0 and b>0:
            if (-a,-b) not in C:
                C[(-a,-b)] = 0
            C[(-a,-b)] += 1
        elif a<0 and b==0:
            if (-a,b) not in C:
                C[(-a,b)] = 0
            C[(-a,b)] += 1
        elif a<0 and b<0:
            if (-a,-b) not in C:
                C[(-a,-b)] = 0
            C[(-a,-b)] += 1
    C = sorted(list(C.items()),key=lambda x:x[1],reverse=True)
    k = C[0][1]
    print(N-k) from itertools import combinations N = int(input()) N int(input()) int input() input 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 X = [list(map(int,input().split())) for _ in range(N)] X [list(map(int,input().split())) for _ in range(N)] if N==1:
    print(1)
else:
    C = {}
    for z in combinations(X,2):
        x1,x2 = z
        a = x1[0]-x2[0]
        b = x1[1]-x2[1]
        if a>=0 and b>=0:
            if (a,b) not in C:
                C[(a,b)] = 0
            C[(a,b)] += 1
        elif a>0 and b<0:
            if (a,b) not in C:
                C[(a,b)] = 0
            C[(a,b)] += 1
        elif a==0 and b<0:
            if (a,-b) not in C:
                C[(a,-b)] = 0
            C[(a,-b)] += 1
        elif a<0 and b>0:
            if (-a,-b) not in C:
                C[(-a,-b)] = 0
            C[(-a,-b)] += 1
        elif a<0 and b==0:
            if (-a,b) not in C:
                C[(-a,b)] = 0
            C[(-a,b)] += 1
        elif a<0 and b<0:
            if (-a,-b) not in C:
                C[(-a,-b)] = 0
            C[(-a,-b)] += 1
    C = sorted(list(C.items()),key=lambda x:x[1],reverse=True)
    k = C[0][1]
    print(N-k) N==1 N 1 print(1) print 1 C = {} C {} for z in combinations(X,2):
        x1,x2 = z
        a = x1[0]-x2[0]
        b = x1[1]-x2[1]
        if a>=0 and b>=0:
            if (a,b) not in C:
                C[(a,b)] = 0
            C[(a,b)] += 1
        elif a>0 and b<0:
            if (a,b) not in C:
                C[(a,b)] = 0
            C[(a,b)] += 1
        elif a==0 and b<0:
            if (a,-b) not in C:
                C[(a,-b)] = 0
            C[(a,-b)] += 1
        elif a<0 and b>0:
            if (-a,-b) not in C:
                C[(-a,-b)] = 0
            C[(-a,-b)] += 1
        elif a<0 and b==0:
            if (-a,b) not in C:
                C[(-a,b)] = 0
            C[(-a,b)] += 1
        elif a<0 and b<0:
            if (-a,-b) not in C:
                C[(-a,-b)] = 0
            C[(-a,-b)] += 1
     z combinations(X,2) combinations X 2 x1,x2 = z x1 z x2 a = x1[0]-x2[0] a x1[0]-x2[0] x1[0] x1 0 x2[0] x2 0 b = x1[1]-x2[1] b x1[1]-x2[1] x1[1] x1 1 x2[1] x2 1 if a>=0 and b>=0:
            if (a,b) not in C:
                C[(a,b)] = 0
            C[(a,b)] += 1
        elif a>0 and b<0:
            if (a,b) not in C:
                C[(a,b)] = 0
            C[(a,b)] += 1
        elif a==0 and b<0:
            if (a,-b) not in C:
                C[(a,-b)] = 0
            C[(a,-b)] += 1
        elif a<0 and b>0:
            if (-a,-b) not in C:
                C[(-a,-b)] = 0
            C[(-a,-b)] += 1
        elif a<0 and b==0:
            if (-a,b) not in C:
                C[(-a,b)] = 0
            C[(-a,b)] += 1
        elif a<0 and b<0:
            if (-a,-b) not in C:
                C[(-a,-b)] = 0
            C[(-a,-b)] += 1
     a>=0 and b>=0 a>=0 a 0 b>=0 b 0 if (a,b) not in C:
                C[(a,b)] = 0
             (a,b) not in C (a,b) a b C C[(a,b)] = 0 C[(a,b)] C (a,b) a b 0 C[(a,b)] += 1 C[(a,b)] C (a,b) a b 1 elif a>0 and b<0:
            if (a,b) not in C:
                C[(a,b)] = 0
            C[(a,b)] += 1
         a>0 and b<0 a>0 a 0 b<0 b 0 if (a,b) not in C:
                C[(a,b)] = 0
             (a,b) not in C (a,b) a b C C[(a,b)] = 0 C[(a,b)] C (a,b) a b 0 C[(a,b)] += 1 C[(a,b)] C (a,b) a b 1 elif a==0 and b<0:
            if (a,-b) not in C:
                C[(a,-b)] = 0
            C[(a,-b)] += 1
         a==0 and b<0 a==0 a 0 b<0 b 0 if (a,-b) not in C:
                C[(a,-b)] = 0
             (a,-b) not in C (a,-b) a -b b C C[(a,-b)] = 0 C[(a,-b)] C (a,-b) a -b b 0 C[(a,-b)] += 1 C[(a,-b)] C (a,-b) a -b b 1 elif a<0 and b>0:
            if (-a,-b) not in C:
                C[(-a,-b)] = 0
            C[(-a,-b)] += 1
         a<0 and b>0 a<0 a 0 b>0 b 0 if (-a,-b) not in C:
                C[(-a,-b)] = 0
             (-a,-b) not in C (-a,-b) -a a -b b C C[(-a,-b)] = 0 C[(-a,-b)] C (-a,-b) -a a -b b 0 C[(-a,-b)] += 1 C[(-a,-b)] C (-a,-b) -a a -b b 1 elif a<0 and b==0:
            if (-a,b) not in C:
                C[(-a,b)] = 0
            C[(-a,b)] += 1
         a<0 and b==0 a<0 a 0 b==0 b 0 if (-a,b) not in C:
                C[(-a,b)] = 0
             (-a,b) not in C (-a,b) -a a b C C[(-a,b)] = 0 C[(-a,b)] C (-a,b) -a a b 0 C[(-a,b)] += 1 C[(-a,b)] C (-a,b) -a a b 1 elif a<0 and b<0:
            if (-a,-b) not in C:
                C[(-a,-b)] = 0
            C[(-a,-b)] += 1
     a<0 and b<0 a<0 a 0 b<0 b 0 if (-a,-b) not in C:
                C[(-a,-b)] = 0
             (-a,-b) not in C (-a,-b) -a a -b b C C[(-a,-b)] = 0 C[(-a,-b)] C (-a,-b) -a a -b b 0 C[(-a,-b)] += 1 C[(-a,-b)] C (-a,-b) -a a -b b 1 C = sorted(list(C.items()),key=lambda x:x[1],reverse=True) C sorted(list(C.items()),key=lambda x:x[1],reverse=True) sorted list(C.items()) list C.items() C.items C items key=lambda x:x[1] key lambda x:x[1] x[1] x 1 x reverse=True reverse True k = C[0][1] k C[0][1] [0] C 0 1 print(N-k) print N-k N k C = {} {} C N = int(input()) int(input()) N b = x1[1]-x2[1] x1[1]-x2[1] b x1,x2 = z z x1 C = sorted(list(C.items()),key=lambda x:x[1],reverse=True) sorted(list(C.items()),key=lambda x:x[1],reverse=True) C x2 = z z x2 X = [list(map(int,input().split())) for _ in range(N)] [list(map(int,input().split())) for _ in range(N)] X k = C[0][1] C[0][1] k a = x1[0]-x2[0] x1[0]-x2[0] a
from itertools import combinations
N = int(input())
X = [list(map(int,input().split())) for _ in range(N)]
if N==1:
    print(1)
else:
    C = {}
    for z in combinations(X,2):
        x1,x2 = z
        a = x1[0]-x2[0]
        b = x1[1]-x2[1]
        if a>=0 and b>=0:
            if (a,b) not in C:
                C[(a,b)] = 0
            C[(a,b)] += 1
        elif a>0 and b<0:
            if (a,b) not in C:
                C[(a,b)] = 0
            C[(a,b)] += 1
        elif a==0 and b<0:
            if (a,-b) not in C:
                C[(a,-b)] = 0
            C[(a,-b)] += 1
        elif a<0 and b>0:
            if (-a,-b) not in C:
                C[(-a,-b)] = 0
            C[(-a,-b)] += 1
        elif a<0 and b==0:
            if (-a,b) not in C:
                C[(-a,b)] = 0
            C[(-a,b)] += 1
        elif a<0 and b<0:
            if (-a,-b) not in C:
                C[(-a,-b)] = 0
            C[(-a,-b)] += 1
    C = sorted(list(C.items()),key=lambda x:x[1],reverse=True)
    k = C[0][1]
    print(N-k)