import sys
input = sys.stdin.readline
sys.setrecursionlimit(10000000)
from collections import defaultdict
mod = 10**9+7

N = int(input())
xy = [list(map(int, input().split())) for i in range(N)]
xy.sort()
Ans = N
for i in range(N):
    for j in range(i+1, N):
        a, b = xy[j][0]-xy[i][0], xy[j][1]-xy[i][1]
        ans = N
        for k in range(N):
            for l in range(k+1, N):
                if xy[k][0]+a == xy[l][0] and xy[k][1]+b == xy[l][1]:
                    ans -= 1
        Ans = min(Ans, ans)
print(Ans) import sys sys input = sys.stdin.readline input sys.stdin.readline sys.stdin sys stdin readline sys.setrecursionlimit(10000000) sys.setrecursionlimit sys setrecursionlimit 10000000 from collections import defaultdict mod = 10**9+7 mod 10**9+7 10**9 10 9 7 N = int(input()) N int(input()) int input() input list(map(int, input().split())) for i in range(N) for i in range(N) i range(N) range N for i in range(N) list(map(int, input().split())) list map(int, input().split()) map int input().split() ().split () input split xy = [list(map(int, input().split())) for i in range(N)] xy [list(map(int, input().split())) for i in range(N)] xy.sort() xy.sort xy sort Ans = N Ans N for i in range(N):
    for j in range(i+1, N):
        a, b = xy[j][0]-xy[i][0], xy[j][1]-xy[i][1]
        ans = N
        for k in range(N):
            for l in range(k+1, N):
                if xy[k][0]+a == xy[l][0] and xy[k][1]+b == xy[l][1]:
                    ans -= 1
        Ans = min(Ans, ans) i range(N) range N for j in range(i+1, N):
        a, b = xy[j][0]-xy[i][0], xy[j][1]-xy[i][1]
        ans = N
        for k in range(N):
            for l in range(k+1, N):
                if xy[k][0]+a == xy[l][0] and xy[k][1]+b == xy[l][1]:
                    ans -= 1
        Ans = min(Ans, ans) j range(i+1, N) range i+1 i 1 N a, b = xy[j][0]-xy[i][0], xy[j][1]-xy[i][1] a xy[j][0]-xy[i][0] xy[j][0] [j] xy j 0 xy[i][0] [i] xy i 0 b xy[j][1]-xy[i][1] xy[j][1] [j] xy j 1 xy[i][1] [i] xy i 1 ans = N ans N for k in range(N):
            for l in range(k+1, N):
                if xy[k][0]+a == xy[l][0] and xy[k][1]+b == xy[l][1]:
                    ans -= 1
         k range(N) range N for l in range(k+1, N):
                if xy[k][0]+a == xy[l][0] and xy[k][1]+b == xy[l][1]:
                    ans -= 1
         l range(k+1, N) range k+1 k 1 N if xy[k][0]+a == xy[l][0] and xy[k][1]+b == xy[l][1]:
                    ans -= 1
         xy[k][0]+a == xy[l][0] and xy[k][1]+b == xy[l][1] xy[k][0]+a == xy[l][0] xy[k][0]+a xy[k][0] [k] xy k 0 a xy[l][0] [l] xy l 0 xy[k][1]+b == xy[l][1] xy[k][1]+b xy[k][1] [k] xy k 1 b xy[l][1] [l] xy l 1 ans -= 1 ans 1 Ans = min(Ans, ans) Ans min(Ans, ans) min Ans ans print(Ans) print Ans b = xy[j][0]-xy[i][0], xy[j][1]-xy[i][1] xy[j][1]-xy[i][1] b Ans = min(Ans, ans) min(Ans, ans) Ans ans = N N ans mod = 10**9+7 10**9+7 mod xy = [list(map(int, input().split())) for i in range(N)] [list(map(int, input().split())) for i in range(N)] xy N = int(input()) int(input()) N input = sys.stdin.readline sys.stdin.readline input a, b = xy[j][0]-xy[i][0], xy[j][1]-xy[i][1] xy[j][0]-xy[i][0] a ans -= 1 1 ans Ans = N N Ans
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10000000)
from collections import defaultdict
mod = 10**9+7

N = int(input())
xy = [list(map(int, input().split())) for i in range(N)]
xy.sort()
Ans = N
for i in range(N):
    for j in range(i+1, N):
        a, b = xy[j][0]-xy[i][0], xy[j][1]-xy[i][1]
        ans = N
        for k in range(N):
            for l in range(k+1, N):
                if xy[k][0]+a == xy[l][0] and xy[k][1]+b == xy[l][1]:
                    ans -= 1
        Ans = min(Ans, ans)
print(Ans)
