#!/usr/bin/env python3

import sys
from typing import Any, Callable, Deque, Dict, List, Mapping, Optional, Sequence, Set, Tuple, TypeVar, Union
# import time
# import math, cmath
# import numpy as np
# import scipy.sparse.csgraph as cs            # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random                                # random, uniform, randint, randrange, shuffle, sample
# import string                                # ascii_lowercase, ascii_uppercase, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from datetime import date, datetime          # date.today(), date(year,month,day) => date obj; datetime.now(), datetime(year,month,day,hour,second,microsecond) => datetime obj; subtraction => timedelta obj
# from datetime.datetime import strptime       # strptime('2019/01/01 10:05:20', '%Y/%m/%d/ %H:%M:%S') returns datetime obj
# from datetime import timedelta               # td.days, td.seconds, td.microseconds, td.total_seconds(). abs function is also available.
# from copy import copy, deepcopy              # use deepcopy to copy multi-dimentional matrix without reference
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import _heapify_max, _heappop_max, _siftdown_max
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from fractions import Fraction               # Fraction(a, b) => a / b ∈ Q. note: Fraction(0.1) do not returns Fraciton(1, 10). Fraction('0.1') returns Fraction(1, 10)



def main():
    Num = Union[int, float]
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79e+308
    # inf = 2 ** 63 - 1             # (for fast JIT compile in PyPy) 9.22e+18
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def isp():   return input().split()
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    # def _heappush_max(h, item): h.append(item); _siftdown_max(h, 0, len(h)-1)
    

    def calc_cost(p, q, points):
        selected = [False] * n
        cnt = 0
        for i in range(n):
            if not selected[i]:
                selected[i] = True
                cnt += 1
                x, y = points[i]
                while True:
                    if [x + p, y + q] in points:
                        selected[points.index([x + p, y + q])] = True
                        x, y = x + p, y + q
                    else:
                        break
                x, y = points[i]
                while True:
                    if [x - p, y - q] in points:
                        selected[points.index([x - p, y - q])] = True
                        x, y = x - p, y - q
                    else:
                        break
        return cnt
    
    
    n = ii()
    points = [lmi() for _ in range(n)]

    if n == 1:
        print(1)
    else:
        cost = inf
        for i in range(n):
            for j in range(n):
                if i != j:
                    p = points[i][0] - points[j][0]
                    q = points[i][1] - points[j][1]
                    cost = min(cost, calc_cost(p, q, points))
        print(cost)



if __name__ == "__main__":
    main() import sys sys from typing import Any, Callable, Deque, Dict, List, Mapping, Optional, Sequence, Set, Tuple, TypeVar, Union def main():
    Num = Union[int, float]
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79e+308
    # inf = 2 ** 63 - 1             # (for fast JIT compile in PyPy) 9.22e+18
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def isp():   return input().split()
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    # def _heappush_max(h, item): h.append(item); _siftdown_max(h, 0, len(h)-1)
    

    def calc_cost(p, q, points):
        selected = [False] * n
        cnt = 0
        for i in range(n):
            if not selected[i]:
                selected[i] = True
                cnt += 1
                x, y = points[i]
                while True:
                    if [x + p, y + q] in points:
                        selected[points.index([x + p, y + q])] = True
                        x, y = x + p, y + q
                    else:
                        break
                x, y = points[i]
                while True:
                    if [x - p, y - q] in points:
                        selected[points.index([x - p, y - q])] = True
                        x, y = x - p, y - q
                    else:
                        break
        return cnt
    
    
    n = ii()
    points = [lmi() for _ in range(n)]

    if n == 1:
        print(1)
    else:
        cost = inf
        for i in range(n):
            for j in range(n):
                if i != j:
                    p = points[i][0] - points[j][0]
                    q = points[i][1] - points[j][1]
                    cost = min(cost, calc_cost(p, q, points))
        print(cost) main Num = Union[int, float] Num Union[int, float] Union int mod = 1000000007 mod 1000000007 inf = float('inf') inf float('inf') float 'inf' sys.setrecursionlimit(10**6) sys.setrecursionlimit sys setrecursionlimit 10**6 10 6 def input(): return sys.stdin.readline().rstrip()
     input def ii():    return int(input())
     ii def isp():   return input().split()
     isp def mi():    return map(int, input().split())
     mi def mi_0():  return map(lambda x: int(x)-1, input().split())
     mi_0 def lmi():   return list(map(int, input().split()))
     lmi def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
     lmi_0 def li():    return list(input())
    # def _heappush_max(h, item): h.append(item); _siftdown_max(h, 0, len(h)-1)
    

     li def calc_cost(p, q, points):
        selected = [False] * n
        cnt = 0
        for i in range(n):
            if not selected[i]:
                selected[i] = True
                cnt += 1
                x, y = points[i]
                while True:
                    if [x + p, y + q] in points:
                        selected[points.index([x + p, y + q])] = True
                        x, y = x + p, y + q
                    else:
                        break
                x, y = points[i]
                while True:
                    if [x - p, y - q] in points:
                        selected[points.index([x - p, y - q])] = True
                        x, y = x - p, y - q
                    else:
                        break
        return cnt
    
    
     calc_cost selected = [False] * n selected [False] * n [False] False n cnt = 0 cnt 0 for i in range(n):
            if not selected[i]:
                selected[i] = True
                cnt += 1
                x, y = points[i]
                while True:
                    if [x + p, y + q] in points:
                        selected[points.index([x + p, y + q])] = True
                        x, y = x + p, y + q
                    else:
                        break
                x, y = points[i]
                while True:
                    if [x - p, y - q] in points:
                        selected[points.index([x - p, y - q])] = True
                        x, y = x - p, y - q
                    else:
                        break
         i range(n) range n if not selected[i]:
                selected[i] = True
                cnt += 1
                x, y = points[i]
                while True:
                    if [x + p, y + q] in points:
                        selected[points.index([x + p, y + q])] = True
                        x, y = x + p, y + q
                    else:
                        break
                x, y = points[i]
                while True:
                    if [x - p, y - q] in points:
                        selected[points.index([x - p, y - q])] = True
                        x, y = x - p, y - q
                    else:
                        break
         not selected[i] selected[i] selected i selected[i] = True selected[i] selected i True cnt += 1 cnt 1 x, y = points[i] x points[i] points i y while True:
                    if [x + p, y + q] in points:
                        selected[points.index([x + p, y + q])] = True
                        x, y = x + p, y + q
                    else:
                        break
                 True if [x + p, y + q] in points:
                        selected[points.index([x + p, y + q])] = True
                        x, y = x + p, y + q
                    else:
                        break
                 [x + p, y + q] in points [x + p, y + q] x + p x p y + q y q points selected[points.index([x + p, y + q])] = True selected[points.index([x + p, y + q])] selected points.index([x + p, y + q]) points.index points index [x + p, y + q] x + p x p y + q y q True x, y = x + p, y + q x x + p x p y y + q y q break x, y = points[i] x points[i] points i y while True:
                    if [x - p, y - q] in points:
                        selected[points.index([x - p, y - q])] = True
                        x, y = x - p, y - q
                    else:
                        break
         True if [x - p, y - q] in points:
                        selected[points.index([x - p, y - q])] = True
                        x, y = x - p, y - q
                    else:
                        break
         [x - p, y - q] in points [x - p, y - q] x - p x p y - q y q points selected[points.index([x - p, y - q])] = True selected[points.index([x - p, y - q])] selected points.index([x - p, y - q]) points.index points index [x - p, y - q] x - p x p y - q y q True x, y = x - p, y - q x x - p x p y y - q y q break return cnt cnt p p q q points points n = ii() n ii() ii lmi() for _ in range(n) for _ in range(n) _ range(n) range n for _ in range(n) lmi() lmi points = [lmi() for _ in range(n)] points [lmi() for _ in range(n)] if n == 1:
        print(1)
    else:
        cost = inf
        for i in range(n):
            for j in range(n):
                if i != j:
                    p = points[i][0] - points[j][0]
                    q = points[i][1] - points[j][1]
                    cost = min(cost, calc_cost(p, q, points))
        print(cost) n == 1 n 1 print(1) print 1 cost = inf cost inf for i in range(n):
            for j in range(n):
                if i != j:
                    p = points[i][0] - points[j][0]
                    q = points[i][1] - points[j][1]
                    cost = min(cost, calc_cost(p, q, points))
         i range(n) range n for j in range(n):
                if i != j:
                    p = points[i][0] - points[j][0]
                    q = points[i][1] - points[j][1]
                    cost = min(cost, calc_cost(p, q, points))
         j range(n) range n if i != j:
                    p = points[i][0] - points[j][0]
                    q = points[i][1] - points[j][1]
                    cost = min(cost, calc_cost(p, q, points))
         i != j i j p = points[i][0] - points[j][0] p points[i][0] - points[j][0] points[i][0] [i] points i 0 points[j][0] [j] points j 0 q = points[i][1] - points[j][1] q points[i][1] - points[j][1] points[i][1] [i] points i 1 points[j][1] [j] points j 1 cost = min(cost, calc_cost(p, q, points)) cost min(cost, calc_cost(p, q, points)) min cost calc_cost(p, q, points) calc_cost p q points print(cost) print cost if __name__ == "__main__":
    main() __name__ == "__main__" __name__ "__main__" main() main def main():
    Num = Union[int, float]
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79e+308
    # inf = 2 ** 63 - 1             # (for fast JIT compile in PyPy) 9.22e+18
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def isp():   return input().split()
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    # def _heappush_max(h, item): h.append(item); _siftdown_max(h, 0, len(h)-1)
    

    def calc_cost(p, q, points):
        selected = [False] * n
        cnt = 0
        for i in range(n):
            if not selected[i]:
                selected[i] = True
                cnt += 1
                x, y = points[i]
                while True:
                    if [x + p, y + q] in points:
                        selected[points.index([x + p, y + q])] = True
                        x, y = x + p, y + q
                    else:
                        break
                x, y = points[i]
                while True:
                    if [x - p, y - q] in points:
                        selected[points.index([x - p, y - q])] = True
                        x, y = x - p, y - q
                    else:
                        break
        return cnt
    
    
    n = ii()
    points = [lmi() for _ in range(n)]

    if n == 1:
        print(1)
    else:
        cost = inf
        for i in range(n):
            for j in range(n):
                if i != j:
                    p = points[i][0] - points[j][0]
                    q = points[i][1] - points[j][1]
                    cost = min(cost, calc_cost(p, q, points))
        print(cost) def main():
    Num = Union[int, float]
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79e+308
    # inf = 2 ** 63 - 1             # (for fast JIT compile in PyPy) 9.22e+18
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def isp():   return input().split()
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    # def _heappush_max(h, item): h.append(item); _siftdown_max(h, 0, len(h)-1)
    

    def calc_cost(p, q, points):
        selected = [False] * n
        cnt = 0
        for i in range(n):
            if not selected[i]:
                selected[i] = True
                cnt += 1
                x, y = points[i]
                while True:
                    if [x + p, y + q] in points:
                        selected[points.index([x + p, y + q])] = True
                        x, y = x + p, y + q
                    else:
                        break
                x, y = points[i]
                while True:
                    if [x - p, y - q] in points:
                        selected[points.index([x - p, y - q])] = True
                        x, y = x - p, y - q
                    else:
                        break
        return cnt
    
    
    n = ii()
    points = [lmi() for _ in range(n)]

    if n == 1:
        print(1)
    else:
        cost = inf
        for i in range(n):
            for j in range(n):
                if i != j:
                    p = points[i][0] - points[j][0]
                    q = points[i][1] - points[j][1]
                    cost = min(cost, calc_cost(p, q, points))
        print(cost) main
#!/usr/bin/env python3

import sys
from typing import Any, Callable, Deque, Dict, List, Mapping, Optional, Sequence, Set, Tuple, TypeVar, Union
# import time
# import math, cmath
# import numpy as np
# import scipy.sparse.csgraph as cs            # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random                                # random, uniform, randint, randrange, shuffle, sample
# import string                                # ascii_lowercase, ascii_uppercase, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from datetime import date, datetime          # date.today(), date(year,month,day) => date obj; datetime.now(), datetime(year,month,day,hour,second,microsecond) => datetime obj; subtraction => timedelta obj
# from datetime.datetime import strptime       # strptime('2019/01/01 10:05:20', '%Y/%m/%d/ %H:%M:%S') returns datetime obj
# from datetime import timedelta               # td.days, td.seconds, td.microseconds, td.total_seconds(). abs function is also available.
# from copy import copy, deepcopy              # use deepcopy to copy multi-dimentional matrix without reference
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import _heapify_max, _heappop_max, _siftdown_max
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from fractions import Fraction               # Fraction(a, b) => a / b ∈ Q. note: Fraction(0.1) do not returns Fraciton(1, 10). Fraction('0.1') returns Fraction(1, 10)



def main():
    Num = Union[int, float]
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79e+308
    # inf = 2 ** 63 - 1             # (for fast JIT compile in PyPy) 9.22e+18
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def isp():   return input().split()
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    # def _heappush_max(h, item): h.append(item); _siftdown_max(h, 0, len(h)-1)
    

    def calc_cost(p, q, points):
        selected = [False] * n
        cnt = 0
        for i in range(n):
            if not selected[i]:
                selected[i] = True
                cnt += 1
                x, y = points[i]
                while True:
                    if [x + p, y + q] in points:
                        selected[points.index([x + p, y + q])] = True
                        x, y = x + p, y + q
                    else:
                        break
                x, y = points[i]
                while True:
                    if [x - p, y - q] in points:
                        selected[points.index([x - p, y - q])] = True
                        x, y = x - p, y - q
                    else:
                        break
        return cnt
    
    
    n = ii()
    points = [lmi() for _ in range(n)]

    if n == 1:
        print(1)
    else:
        cost = inf
        for i in range(n):
            for j in range(n):
                if i != j:
                    p = points[i][0] - points[j][0]
                    q = points[i][1] - points[j][1]
                    cost = min(cost, calc_cost(p, q, points))
        print(cost)



if __name__ == "__main__":
    main()
