import sys

import itertools

import collections

sys.setrecursionlimit(10**7)

def lmi(): return list(map(int, input().split()))



n = int(eval(input()))

x = [0] * n

y = [0] * n

for i in range(n):

    x[i], y[i] = lmi()



d = [[0 for j in range(n)] for i in range(n)]

for i in range(n):

    for j in range(n):

        d[i][j] = (x[i]-x[j], y[i]-y[j])



dd = []

for i in range(n):

    dd += d[i]



c = collections.Counter(dd)

c1 = c.most_common()[0]

if c1[0] == (0,0) and n != 1:

    c1 = c.most_common()[1]

    print((n-c1[1]))

else:

    print((1))

import sys

import itertools

import collections

sys.setrecursionlimit(10**7)

def lmi(): return list(map(int, input().split()))



n = int(eval(input()))

x = [0] * n

y = [0] * n

for i in range(n):

    x[i], y[i] = lmi()



d = []

for i in range(n):

    for j in range(n):

        d.append((x[i]-x[j], y[i]-y[j]))



c = collections.Counter(d)

if n != 1:

    c1 = c.most_common()[1]

    print((n - c1[1]))

else:

    print((1))

import sys
import itertools
import collections

sys.setrecursionlimit(10**7)


def lmi():
    return list(map(int, input().split()))


n = int(eval(input()))
x = [0] * n
y = [0] * n
for i in range(n):
    x[i], y[i] = lmi()
d = [[0 for j in range(n)] for i in range(n)]
for i in range(n):
    for j in range(n):
        d[i][j] = (x[i] - x[j], y[i] - y[j])
dd = []
for i in range(n):
    dd += d[i]
c = collections.Counter(dd)
c1 = c.most_common()[0]
if c1[0] == (0, 0) and n != 1:
    c1 = c.most_common()[1]
    print((n - c1[1]))
else:
    print((1))

import sys
import itertools
import collections

sys.setrecursionlimit(10**7)


def lmi():
    return list(map(int, input().split()))


n = int(eval(input()))
x = [0] * n
y = [0] * n
for i in range(n):
    x[i], y[i] = lmi()
d = []
for i in range(n):
    for j in range(n):
        d.append((x[i] - x[j], y[i] - y[j]))
c = collections.Counter(d)
if n != 1:
    c1 = c.most_common()[1]
    print((n - c1[1]))
else:
    print((1))

-d = [[0 for j in range(n)] for i in range(n)] +d = [] -        d[i][j] = (x[i] - x[j], y[i] - y[j]) -dd = [] -for i in range(n): -    dd += d[i] -c = collections.Counter(dd) -c1 = c.most_common()[0] -if c1[0] == (0, 0) and n != 1: +        d.append((x[i] - x[j], y[i] - y[j])) +c = collections.Counter(d) +if n != 1: