N=int(input())
x=[]
y=[]
l=[]
for i in range(N):
    a,b=map(int,input().split())
    x.append(a)
    y.append(b)
l.sort()

d=dict()
r=[]
for i in range(N):
    for j in range(N):
        if i==j:
            continue
        p = x[i]-x[j]
        q = y[i]-y[j]
        c=(p,q)
        if c in d:
            d[c]+=1
        else:
            d[c]=1
ans=0
#print(d)
for i,j in d.items():
    ans=max(ans,j)

print(N-ans) N=int(input()) N int(input()) int input() input x=[] x [] y=[] y [] l=[] l [] for i in range(N):
    a,b=map(int,input().split())
    x.append(a)
    y.append(b) i range(N) range N a,b=map(int,input().split()) a map(int,input().split()) map int input().split() ().split () input split b x.append(a) x.append x append a y.append(b) y.append y append b l.sort() l.sort l sort d=dict() d dict() dict r=[] r [] for i in range(N):
    for j in range(N):
        if i==j:
            continue
        p = x[i]-x[j]
        q = y[i]-y[j]
        c=(p,q)
        if c in d:
            d[c]+=1
        else:
            d[c]=1 i range(N) range N for j in range(N):
        if i==j:
            continue
        p = x[i]-x[j]
        q = y[i]-y[j]
        c=(p,q)
        if c in d:
            d[c]+=1
        else:
            d[c]=1 j range(N) range N if i==j:
            continue
         i==j i j continue p = x[i]-x[j] p x[i]-x[j] x[i] x i x[j] x j q = y[i]-y[j] q y[i]-y[j] y[i] y i y[j] y j c=(p,q) c (p,q) p q if c in d:
            d[c]+=1
        else:
            d[c]=1 c in d c d d[c]+=1 d[c] d c 1 d[c]=1 d[c] d c 1 ans=0 ans 0 for i,j in d.items():
    ans=max(ans,j) i j d.items() d.items d items ans=max(ans,j) ans max(ans,j) max ans j print(N-ans) print N-ans N ans y=[] [] y c=(p,q) (p,q) c a,b=map(int,input().split()) map(int,input().split()) a r=[] [] r ans=max(ans,j) max(ans,j) ans q = y[i]-y[j] y[i]-y[j] q l=[] [] l p = x[i]-x[j] x[i]-x[j] p N=int(input()) int(input()) N x=[] [] x d=dict() dict() d b=map(int,input().split()) map(int,input().split()) b ans=0 0 ans
N=int(input())
x=[]
y=[]
l=[]
for i in range(N):
    a,b=map(int,input().split())
    x.append(a)
    y.append(b)
l.sort()

d=dict()
r=[]
for i in range(N):
    for j in range(N):
        if i==j:
            continue
        p = x[i]-x[j]
        q = y[i]-y[j]
        c=(p,q)
        if c in d:
            d[c]+=1
        else:
            d[c]=1
ans=0
#print(d)
for i,j in d.items():
    ans=max(ans,j)

print(N-ans)