n = int(input())
xyl = []
for _ in range(n):
    x,y = map(int,input().split())
    xyl.append((x,y))

ans = n
set_cover = []
for i in range(n):
    for j in range(i+1, n):
        p = xyl[j][0] - xyl[i][0]
        q = xyl[j][1] - xyl[i][1]
        tmp = n
        for k in range(n):
            for l in range(n):
                x = xyl[l][0] - xyl[k][0]
                y = xyl[l][1] - xyl[k][1]
                if p == x and q == y:
                    tmp -= 1
        ans = min(ans, tmp)
print(ans) n = int(input()) n int(input()) int input() input xyl = [] xyl [] for _ in range(n):
    x,y = map(int,input().split())
    xyl.append((x,y)) _ range(n) range n x,y = map(int,input().split()) x map(int,input().split()) map int input().split() ().split () input split y xyl.append((x,y)) xyl.append xyl append (x,y) x y ans = n ans n set_cover = [] set_cover [] for i in range(n):
    for j in range(i+1, n):
        p = xyl[j][0] - xyl[i][0]
        q = xyl[j][1] - xyl[i][1]
        tmp = n
        for k in range(n):
            for l in range(n):
                x = xyl[l][0] - xyl[k][0]
                y = xyl[l][1] - xyl[k][1]
                if p == x and q == y:
                    tmp -= 1
        ans = min(ans, tmp) i range(n) range n for j in range(i+1, n):
        p = xyl[j][0] - xyl[i][0]
        q = xyl[j][1] - xyl[i][1]
        tmp = n
        for k in range(n):
            for l in range(n):
                x = xyl[l][0] - xyl[k][0]
                y = xyl[l][1] - xyl[k][1]
                if p == x and q == y:
                    tmp -= 1
        ans = min(ans, tmp) j range(i+1, n) range i+1 i 1 n p = xyl[j][0] - xyl[i][0] p xyl[j][0] - xyl[i][0] xyl[j][0] [j] xyl j 0 xyl[i][0] [i] xyl i 0 q = xyl[j][1] - xyl[i][1] q xyl[j][1] - xyl[i][1] xyl[j][1] [j] xyl j 1 xyl[i][1] [i] xyl i 1 tmp = n tmp n for k in range(n):
            for l in range(n):
                x = xyl[l][0] - xyl[k][0]
                y = xyl[l][1] - xyl[k][1]
                if p == x and q == y:
                    tmp -= 1
         k range(n) range n for l in range(n):
                x = xyl[l][0] - xyl[k][0]
                y = xyl[l][1] - xyl[k][1]
                if p == x and q == y:
                    tmp -= 1
         l range(n) range n x = xyl[l][0] - xyl[k][0] x xyl[l][0] - xyl[k][0] xyl[l][0] [l] xyl l 0 xyl[k][0] [k] xyl k 0 y = xyl[l][1] - xyl[k][1] y xyl[l][1] - xyl[k][1] xyl[l][1] [l] xyl l 1 xyl[k][1] [k] xyl k 1 if p == x and q == y:
                    tmp -= 1
         p == x and q == y p == x p x q == y q y tmp -= 1 tmp 1 ans = min(ans, tmp) ans min(ans, tmp) min ans tmp print(ans) print ans set_cover = [] [] set_cover ans = n n ans xyl = [] [] xyl q = xyl[j][1] - xyl[i][1] xyl[j][1] - xyl[i][1] q tmp = n n tmp y = map(int,input().split()) map(int,input().split()) y p = xyl[j][0] - xyl[i][0] xyl[j][0] - xyl[i][0] p n = int(input()) int(input()) n ans = min(ans, tmp) min(ans, tmp) ans y = xyl[l][1] - xyl[k][1] xyl[l][1] - xyl[k][1] y x = xyl[l][0] - xyl[k][0] xyl[l][0] - xyl[k][0] x tmp -= 1 1 tmp x,y = map(int,input().split()) map(int,input().split()) x
n = int(input())
xyl = []
for _ in range(n):
    x,y = map(int,input().split())
    xyl.append((x,y))

ans = n
set_cover = []
for i in range(n):
    for j in range(i+1, n):
        p = xyl[j][0] - xyl[i][0]
        q = xyl[j][1] - xyl[i][1]
        tmp = n
        for k in range(n):
            for l in range(n):
                x = xyl[l][0] - xyl[k][0]
                y = xyl[l][1] - xyl[k][1]
                if p == x and q == y:
                    tmp -= 1
        ans = min(ans, tmp)
print(ans)
