N = int(input())

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

from collections import defaultdict

if N == 1:
    print(1)
    exit(0)

cnt = defaultdict(int)
for pi in range(N):
    for pj in range(N):
        if pi == pj:
            continue
        # x
        dx = P[pi][0] - P[pj][0]

        # y
        dy = P[pi][1] - P[pj][1]

        cnt[(dx, dy)] += 1

ans = N-max(cnt.values())
print(ans)
 N = int(input()) N int(input()) int input() input P = [] P [] for _ in range(N):
    x, y = map(int, input().split())
    P.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 P.append((x, y)) P.append P append (x, y) x y from collections import defaultdict if N == 1:
    print(1)
    exit(0) N == 1 N 1 print(1) print 1 exit(0) exit 0 cnt = defaultdict(int) cnt defaultdict(int) defaultdict int for pi in range(N):
    for pj in range(N):
        if pi == pj:
            continue
        # x
        dx = P[pi][0] - P[pj][0]

        # y
        dy = P[pi][1] - P[pj][1]

        cnt[(dx, dy)] += 1 pi range(N) range N for pj in range(N):
        if pi == pj:
            continue
        # x
        dx = P[pi][0] - P[pj][0]

        # y
        dy = P[pi][1] - P[pj][1]

        cnt[(dx, dy)] += 1 pj range(N) range N if pi == pj:
            continue
        # x
         pi == pj pi pj continue dx = P[pi][0] - P[pj][0] dx P[pi][0] - P[pj][0] P[pi][0] [pi] P pi 0 P[pj][0] [pj] P pj 0 dy = P[pi][1] - P[pj][1] dy P[pi][1] - P[pj][1] P[pi][1] [pi] P pi 1 P[pj][1] [pj] P pj 1 cnt[(dx, dy)] += 1 cnt[(dx, dy)] cnt (dx, dy) dx dy 1 ans = N-max(cnt.values()) ans N-max(cnt.values()) N max(cnt.values()) max cnt.values() cnt.values cnt values print(ans) print ans cnt = defaultdict(int) defaultdict(int) cnt y = map(int, input().split()) map(int, input().split()) y P = [] [] P ans = N-max(cnt.values()) N-max(cnt.values()) ans x, y = map(int, input().split()) map(int, input().split()) x dy = P[pi][1] - P[pj][1] P[pi][1] - P[pj][1] dy dx = P[pi][0] - P[pj][0] P[pi][0] - P[pj][0] dx N = int(input()) int(input()) N
N = int(input())

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

from collections import defaultdict

if N == 1:
    print(1)
    exit(0)

cnt = defaultdict(int)
for pi in range(N):
    for pj in range(N):
        if pi == pj:
            continue
        # x
        dx = P[pi][0] - P[pj][0]

        # y
        dy = P[pi][1] - P[pj][1]

        cnt[(dx, dy)] += 1

ans = N-max(cnt.values())
print(ans)

