n = int(input())
pos = []
for _ in range(n):
    p = list(map(int, input().split()))
    pos.append(p)

ans = 0
for i in range(n):
    for j in range(n):
        if i == j:
            continue
        dpos = [pos[i][0] - pos[j][0], pos[i][1] - pos[j][1]]
        cnt = 0
        for k in range(n):
            for l in range(n):
                if k == l:
                    continue
                tmp = [pos[k][0] - pos[l][0], pos[k][1] - pos[l][1]]
                if dpos[0] == tmp[0] and dpos[1] == tmp[1]:
                    cnt += 1
        ans = max(cnt, ans)

print(n-ans) n = int(input()) n int(input()) int input() input pos = [] pos [] for _ in range(n):
    p = list(map(int, input().split()))
    pos.append(p) _ range(n) range n p = list(map(int, input().split())) p list(map(int, input().split())) list map(int, input().split()) map int input().split() ().split () input split pos.append(p) pos.append pos append p ans = 0 ans 0 for i in range(n):
    for j in range(n):
        if i == j:
            continue
        dpos = [pos[i][0] - pos[j][0], pos[i][1] - pos[j][1]]
        cnt = 0
        for k in range(n):
            for l in range(n):
                if k == l:
                    continue
                tmp = [pos[k][0] - pos[l][0], pos[k][1] - pos[l][1]]
                if dpos[0] == tmp[0] and dpos[1] == tmp[1]:
                    cnt += 1
        ans = max(cnt, ans) i range(n) range n for j in range(n):
        if i == j:
            continue
        dpos = [pos[i][0] - pos[j][0], pos[i][1] - pos[j][1]]
        cnt = 0
        for k in range(n):
            for l in range(n):
                if k == l:
                    continue
                tmp = [pos[k][0] - pos[l][0], pos[k][1] - pos[l][1]]
                if dpos[0] == tmp[0] and dpos[1] == tmp[1]:
                    cnt += 1
        ans = max(cnt, ans) j range(n) range n if i == j:
            continue
         i == j i j continue dpos = [pos[i][0] - pos[j][0], pos[i][1] - pos[j][1]] dpos [pos[i][0] - pos[j][0], pos[i][1] - pos[j][1]] pos[i][0] - pos[j][0] pos[i][0] [i] pos i 0 pos[j][0] [j] pos j 0 pos[i][1] - pos[j][1] pos[i][1] [i] pos i 1 pos[j][1] [j] pos j 1 cnt = 0 cnt 0 for k in range(n):
            for l in range(n):
                if k == l:
                    continue
                tmp = [pos[k][0] - pos[l][0], pos[k][1] - pos[l][1]]
                if dpos[0] == tmp[0] and dpos[1] == tmp[1]:
                    cnt += 1
         k range(n) range n for l in range(n):
                if k == l:
                    continue
                tmp = [pos[k][0] - pos[l][0], pos[k][1] - pos[l][1]]
                if dpos[0] == tmp[0] and dpos[1] == tmp[1]:
                    cnt += 1
         l range(n) range n if k == l:
                    continue
                 k == l k l continue tmp = [pos[k][0] - pos[l][0], pos[k][1] - pos[l][1]] tmp [pos[k][0] - pos[l][0], pos[k][1] - pos[l][1]] pos[k][0] - pos[l][0] pos[k][0] [k] pos k 0 pos[l][0] [l] pos l 0 pos[k][1] - pos[l][1] pos[k][1] [k] pos k 1 pos[l][1] [l] pos l 1 if dpos[0] == tmp[0] and dpos[1] == tmp[1]:
                    cnt += 1
         dpos[0] == tmp[0] and dpos[1] == tmp[1] dpos[0] == tmp[0] dpos[0] dpos 0 tmp[0] tmp 0 dpos[1] == tmp[1] dpos[1] dpos 1 tmp[1] tmp 1 cnt += 1 cnt 1 ans = max(cnt, ans) ans max(cnt, ans) max cnt ans print(n-ans) print n-ans n ans p = list(map(int, input().split())) list(map(int, input().split())) p ans = 0 0 ans pos = [] [] pos ans = max(cnt, ans) max(cnt, ans) ans dpos = [pos[i][0] - pos[j][0], pos[i][1] - pos[j][1]] [pos[i][0] - pos[j][0], pos[i][1] - pos[j][1]] dpos tmp = [pos[k][0] - pos[l][0], pos[k][1] - pos[l][1]] [pos[k][0] - pos[l][0], pos[k][1] - pos[l][1]] tmp cnt = 0 0 cnt n = int(input()) int(input()) n cnt += 1 1 cnt
n = int(input())
pos = []
for _ in range(n):
    p = list(map(int, input().split()))
    pos.append(p)

ans = 0
for i in range(n):
    for j in range(n):
        if i == j:
            continue
        dpos = [pos[i][0] - pos[j][0], pos[i][1] - pos[j][1]]
        cnt = 0
        for k in range(n):
            for l in range(n):
                if k == l:
                    continue
                tmp = [pos[k][0] - pos[l][0], pos[k][1] - pos[l][1]]
                if dpos[0] == tmp[0] and dpos[1] == tmp[1]:
                    cnt += 1
        ans = max(cnt, ans)

print(n-ans)
