from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))

n = inp()
a = [inpl() for _ in range(n)]
if n == 1:
    print(1)
    quit()
c = []
for i,(x,y) in enumerate(a):
    for j,(z,w) in enumerate(a):
        if i == j: continue
        c.append(((x-z), (y-w)))
h = Counter(c)
print(n-max(h.values())) from collections import Counter,defaultdict,deque from heapq import heappop,heappush,heapify import sys,bisect,math,itertools,fractions,pprint sys bisect math itertools fractions pprint sys.setrecursionlimit(10**8) sys.setrecursionlimit sys setrecursionlimit 10**8 10 8 mod = 10**9+7 mod 10**9+7 10**9 10 9 7 INF = float('inf') INF float('inf') float 'inf' def inp(): return int(sys.stdin.readline()) inp def inpl(): return list(map(int, sys.stdin.readline().split())) inpl n = inp() n inp() inp inpl() for _ in range(n) for _ in range(n) _ range(n) range n for _ in range(n) inpl() inpl a = [inpl() for _ in range(n)] a [inpl() for _ in range(n)] if n == 1:
    print(1)
    quit() n == 1 n 1 print(1) print 1 quit() quit c = [] c [] for i,(x,y) in enumerate(a):
    for j,(z,w) in enumerate(a):
        if i == j: continue
        c.append(((x-z), (y-w))) i (x,y) x y enumerate(a) enumerate a for j,(z,w) in enumerate(a):
        if i == j: continue
        c.append(((x-z), (y-w))) j (z,w) z w enumerate(a) enumerate a if i == j: continue
         i == j i j c.append(((x-z), (y-w))) c.append c append ((x-z), (y-w)) x-z x z y-w y w h = Counter(c) h Counter(c) Counter c print(n-max(h.values())) print n-max(h.values()) n max(h.values()) max h.values() h.values h values h = Counter(c) Counter(c) h mod = 10**9+7 10**9+7 mod c = [] [] c a = [inpl() for _ in range(n)] [inpl() for _ in range(n)] a INF = float('inf') float('inf') INF def inp(): return int(sys.stdin.readline()) def inp(): return int(sys.stdin.readline()) inp def inpl(): return list(map(int, sys.stdin.readline().split())) def inpl(): return list(map(int, sys.stdin.readline().split())) inpl n = inp() inp() n
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))

n = inp()
a = [inpl() for _ in range(n)]
if n == 1:
    print(1)
    quit()
c = []
for i,(x,y) in enumerate(a):
    for j,(z,w) in enumerate(a):
        if i == j: continue
        c.append(((x-z), (y-w)))
h = Counter(c)
print(n-max(h.values()))
