n=int(input())
l=[]
for i in range(n):
    l.append(list(map(int,input().split())))
ans=n
for i in range(n):
    for j in range(n):
        if i<j:
            p=l[i][0]-l[j][0]
            q=l[i][1]-l[j][1]
            kai=n
            for x in range(n):
                for y in range(n):
                    if l[x][0]-l[y][0]==p and l[x][1]-l[y][1]==q:
                        kai-=1
            ans=min(ans,kai)
print(ans) n=int(input()) n int(input()) int input() input l=[] l [] for i in range(n):
    l.append(list(map(int,input().split()))) i range(n) range n l.append(list(map(int,input().split()))) l.append l append list(map(int,input().split())) list map(int,input().split()) map int input().split() ().split () input split ans=n ans n for i in range(n):
    for j in range(n):
        if i<j:
            p=l[i][0]-l[j][0]
            q=l[i][1]-l[j][1]
            kai=n
            for x in range(n):
                for y in range(n):
                    if l[x][0]-l[y][0]==p and l[x][1]-l[y][1]==q:
                        kai-=1
            ans=min(ans,kai) i range(n) range n for j in range(n):
        if i<j:
            p=l[i][0]-l[j][0]
            q=l[i][1]-l[j][1]
            kai=n
            for x in range(n):
                for y in range(n):
                    if l[x][0]-l[y][0]==p and l[x][1]-l[y][1]==q:
                        kai-=1
            ans=min(ans,kai) j range(n) range n if i<j:
            p=l[i][0]-l[j][0]
            q=l[i][1]-l[j][1]
            kai=n
            for x in range(n):
                for y in range(n):
                    if l[x][0]-l[y][0]==p and l[x][1]-l[y][1]==q:
                        kai-=1
            ans=min(ans,kai) i<j i j p=l[i][0]-l[j][0] 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] q l[i][1]-l[j][1] l[i][1] [i] l i 1 l[j][1] [j] l j 1 kai=n kai n for x in range(n):
                for y in range(n):
                    if l[x][0]-l[y][0]==p and l[x][1]-l[y][1]==q:
                        kai-=1
             x range(n) range n for y in range(n):
                    if l[x][0]-l[y][0]==p and l[x][1]-l[y][1]==q:
                        kai-=1
             y range(n) range n if l[x][0]-l[y][0]==p and l[x][1]-l[y][1]==q:
                        kai-=1
             l[x][0]-l[y][0]==p and l[x][1]-l[y][1]==q l[x][0]-l[y][0]==p l[x][0]-l[y][0] l[x][0] [x] l x 0 l[y][0] [y] l y 0 p l[x][1]-l[y][1]==q l[x][1]-l[y][1] l[x][1] [x] l x 1 l[y][1] [y] l y 1 q kai-=1 kai 1 ans=min(ans,kai) ans min(ans,kai) min ans kai print(ans) print ans kai=n n kai ans=min(ans,kai) min(ans,kai) ans n=int(input()) int(input()) n kai-=1 1 kai ans=n n ans p=l[i][0]-l[j][0] l[i][0]-l[j][0] p q=l[i][1]-l[j][1] l[i][1]-l[j][1] q l=[] [] l
n=int(input())
l=[]
for i in range(n):
    l.append(list(map(int,input().split())))
ans=n
for i in range(n):
    for j in range(n):
        if i<j:
            p=l[i][0]-l[j][0]
            q=l[i][1]-l[j][1]
            kai=n
            for x in range(n):
                for y in range(n):
                    if l[x][0]-l[y][0]==p and l[x][1]-l[y][1]==q:
                        kai-=1
            ans=min(ans,kai)
print(ans)