n=int(input())
ans=n
l=[list(map(int,input().split())) for i in range(n)]

for i in range(n):
    for j in range(n):
        if i==j:continue
        p,q=l[i][0]-l[j][0],l[i][1]-l[j][1]
        ret=0
        pre=sorted(l,reverse=1,key=lambda x:p*x[0]+q*x[1])
        while pre:
            ret+=1
            x,y=pre.pop()
            while  [x+p,y+q] in pre:
                pre.remove([x+p,y+q])
                x,y=[x+p,y+q]
        ans=min(ans,ret)
print(ans) n=int(input()) n int(input()) int input() input ans=n ans n list(map(int,input().split())) for i in range(n) for i in range(n) i range(n) range n for i 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 i in range(n)] l [list(map(int,input().split())) for i in range(n)] for i in range(n):
    for j in range(n):
        if i==j:continue
        p,q=l[i][0]-l[j][0],l[i][1]-l[j][1]
        ret=0
        pre=sorted(l,reverse=1,key=lambda x:p*x[0]+q*x[1])
        while pre:
            ret+=1
            x,y=pre.pop()
            while  [x+p,y+q] in pre:
                pre.remove([x+p,y+q])
                x,y=[x+p,y+q]
        ans=min(ans,ret) i range(n) range n for j in range(n):
        if i==j:continue
        p,q=l[i][0]-l[j][0],l[i][1]-l[j][1]
        ret=0
        pre=sorted(l,reverse=1,key=lambda x:p*x[0]+q*x[1])
        while pre:
            ret+=1
            x,y=pre.pop()
            while  [x+p,y+q] in pre:
                pre.remove([x+p,y+q])
                x,y=[x+p,y+q]
        ans=min(ans,ret) j range(n) range n if i==j:continue
         i==j i j p,q=l[i][0]-l[j][0],l[i][1]-l[j][1] p l[i][0]-l[j][0] l[i][0] [i] l i 0 l[j][0] [j] l j 0 q l[i][1]-l[j][1] l[i][1] [i] l i 1 l[j][1] [j] l j 1 ret=0 ret 0 pre=sorted(l,reverse=1,key=lambda x:p*x[0]+q*x[1]) pre sorted(l,reverse=1,key=lambda x:p*x[0]+q*x[1]) sorted l reverse=1 reverse 1 key=lambda x:p*x[0]+q*x[1] key lambda x:p*x[0]+q*x[1] p*x[0]+q*x[1] p*x[0] p x[0] x 0 q*x[1] q x[1] x 1 x while pre:
            ret+=1
            x,y=pre.pop()
            while  [x+p,y+q] in pre:
                pre.remove([x+p,y+q])
                x,y=[x+p,y+q]
         pre ret+=1 ret 1 x,y=pre.pop() x pre.pop() pre.pop pre pop y while  [x+p,y+q] in pre:
                pre.remove([x+p,y+q])
                x,y=[x+p,y+q]
         [x+p,y+q] in pre [x+p,y+q] x+p x p y+q y q pre pre.remove([x+p,y+q]) pre.remove pre remove [x+p,y+q] x+p x p y+q y q x,y=[x+p,y+q] x [x+p,y+q] x+p x p y+q y q y ans=min(ans,ret) ans min(ans,ret) min ans ret print(ans) print ans ans=n n ans l=[list(map(int,input().split())) for i in range(n)] [list(map(int,input().split())) for i in range(n)] l x,y=pre.pop() pre.pop() x n=int(input()) int(input()) n x,y=[x+p,y+q] [x+p,y+q] x pre=sorted(l,reverse=1,key=lambda x:p*x[0]+q*x[1]) sorted(l,reverse=1,key=lambda x:p*x[0]+q*x[1]) pre q=l[i][0]-l[j][0],l[i][1]-l[j][1] l[i][1]-l[j][1] q ret+=1 1 ret y=[x+p,y+q] [x+p,y+q] y p,q=l[i][0]-l[j][0],l[i][1]-l[j][1] l[i][0]-l[j][0] p ans=min(ans,ret) min(ans,ret) ans ret=0 0 ret y=pre.pop() pre.pop() y
n=int(input())
ans=n
l=[list(map(int,input().split())) for i in range(n)]

for i in range(n):
    for j in range(n):
        if i==j:continue
        p,q=l[i][0]-l[j][0],l[i][1]-l[j][1]
        ret=0
        pre=sorted(l,reverse=1,key=lambda x:p*x[0]+q*x[1])
        while pre:
            ret+=1
            x,y=pre.pop()
            while  [x+p,y+q] in pre:
                pre.remove([x+p,y+q])
                x,y=[x+p,y+q]
        ans=min(ans,ret)
print(ans)