import sys
from itertools import combinations
from functools import lru_cache

# 三点が同一直線上にあるかを判定
def is_colinear(p1, p2, p3):
    x1, y1 = p1
    x2, y2 = p2
    x3, y3 = p3
    return (x2 - x1) * (y3 - y1) == (x3 - x1) * (y2 - y1)

# 与えられた点集合が全て一直線上にあるか判定
def is_all_colinear(points):
    if len(points) <= 2:
        return True
    p1, p2 = points[0], points[1]
    for i in range(2, len(points)):
        if not is_colinear(p1, p2, points[i]):
            return False
    return True

def main():
    input = sys.stdin.read
    data = input().strip().split('\n')
    N = int(data[0])
    points = [tuple(map(int, line.split())) for line in data[1:]]

    # すべての一直線上の部分集合を列挙（ビットマスクで管理）
    line_sets = []
    for mask in range(1, 1 << N):
        subset = [points[i] for i in range(N) if (mask >> i) & 1]
        if is_all_colinear(subset):
            line_sets.append(mask)

    # メモ化再帰で最小の線分数を探索
    @lru_cache(None)
    def dfs(used_mask):
        if used_mask == (1 << N) - 1:
            return 0
        res = float('inf')
        for s in line_sets:
            if (s | used_mask) != used_mask:
                res = min(res, 1 + dfs(used_mask | s))
        return res

    print(dfs(0))

if __name__ == "__main__":
    main()