n = int(input())
ball = [list(map(int,input().split())) for i in range(n)]
ans = 0
for x in range(n):
    for y in range(n):
        if x == y:
            continue
        else:
            p = ball[x][0] - ball[y][0]
            q = ball[x][1] - ball[y][1]
            cou = 0
            for i in range(n):
                for j in range(n):
                    if ball[i][0]-ball[j][0] == p and ball[i][1]-ball[j][1] == q:
                        cou += 1
            ans = max(ans,cou)
print(n-ans) n = int(input()) n int(input()) int input() input 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 ball = [list(map(int,input().split())) for i in range(n)] ball [list(map(int,input().split())) for i in range(n)] ans = 0 ans 0 for x in range(n):
    for y in range(n):
        if x == y:
            continue
        else:
            p = ball[x][0] - ball[y][0]
            q = ball[x][1] - ball[y][1]
            cou = 0
            for i in range(n):
                for j in range(n):
                    if ball[i][0]-ball[j][0] == p and ball[i][1]-ball[j][1] == q:
                        cou += 1
            ans = max(ans,cou) x range(n) range n for y in range(n):
        if x == y:
            continue
        else:
            p = ball[x][0] - ball[y][0]
            q = ball[x][1] - ball[y][1]
            cou = 0
            for i in range(n):
                for j in range(n):
                    if ball[i][0]-ball[j][0] == p and ball[i][1]-ball[j][1] == q:
                        cou += 1
            ans = max(ans,cou) y range(n) range n if x == y:
            continue
        else:
            p = ball[x][0] - ball[y][0]
            q = ball[x][1] - ball[y][1]
            cou = 0
            for i in range(n):
                for j in range(n):
                    if ball[i][0]-ball[j][0] == p and ball[i][1]-ball[j][1] == q:
                        cou += 1
            ans = max(ans,cou) x == y x y continue p = ball[x][0] - ball[y][0] p ball[x][0] - ball[y][0] ball[x][0] [x] ball x 0 ball[y][0] [y] ball y 0 q = ball[x][1] - ball[y][1] q ball[x][1] - ball[y][1] ball[x][1] [x] ball x 1 ball[y][1] [y] ball y 1 cou = 0 cou 0 for i in range(n):
                for j in range(n):
                    if ball[i][0]-ball[j][0] == p and ball[i][1]-ball[j][1] == q:
                        cou += 1
             i range(n) range n for j in range(n):
                    if ball[i][0]-ball[j][0] == p and ball[i][1]-ball[j][1] == q:
                        cou += 1
             j range(n) range n if ball[i][0]-ball[j][0] == p and ball[i][1]-ball[j][1] == q:
                        cou += 1
             ball[i][0]-ball[j][0] == p and ball[i][1]-ball[j][1] == q ball[i][0]-ball[j][0] == p ball[i][0]-ball[j][0] ball[i][0] [i] ball i 0 ball[j][0] [j] ball j 0 p ball[i][1]-ball[j][1] == q ball[i][1]-ball[j][1] ball[i][1] [i] ball i 1 ball[j][1] [j] ball j 1 q cou += 1 cou 1 ans = max(ans,cou) ans max(ans,cou) max ans cou print(n-ans) print n-ans n ans n = int(input()) int(input()) n p = ball[x][0] - ball[y][0] ball[x][0] - ball[y][0] p cou = 0 0 cou ans = max(ans,cou) max(ans,cou) ans ball = [list(map(int,input().split())) for i in range(n)] [list(map(int,input().split())) for i in range(n)] ball cou += 1 1 cou q = ball[x][1] - ball[y][1] ball[x][1] - ball[y][1] q ans = 0 0 ans
n = int(input())
ball = [list(map(int,input().split())) for i in range(n)]
ans = 0
for x in range(n):
    for y in range(n):
        if x == y:
            continue
        else:
            p = ball[x][0] - ball[y][0]
            q = ball[x][1] - ball[y][1]
            cou = 0
            for i in range(n):
                for j in range(n):
                    if ball[i][0]-ball[j][0] == p and ball[i][1]-ball[j][1] == q:
                        cou += 1
            ans = max(ans,cou)
print(n-ans)