n = int(input())
xy = [tuple(map(int, input().split())) for _ in range(n)]
pq = []
for i in range(n):
	for j in range(i+1,n):
		if i==j:
			continue
		xi, yi = xy[i]
		xj, yj = xy[j]
		pq.append((xi - xj, yi - yj))
ans = n
for p, q in pq:
	cost = 0
	for x, y in xy:
		if (x + p, y + q) in xy:
			pass
		else:
			cost += 1
	ans = min(ans, cost)
print(ans) n = int(input()) n int(input()) int input() input tuple(map(int, input().split())) for _ in range(n) for _ in range(n) _ range(n) range n for _ in range(n) tuple(map(int, input().split())) tuple map(int, input().split()) map int input().split() ().split () input split xy = [tuple(map(int, input().split())) for _ in range(n)] xy [tuple(map(int, input().split())) for _ in range(n)] pq = [] pq [] for i in range(n):
	for j in range(i+1,n):
		if i==j:
			continue
		xi, yi = xy[i]
		xj, yj = xy[j]
		pq.append((xi - xj, yi - yj)) i range(n) range n for j in range(i+1,n):
		if i==j:
			continue
		xi, yi = xy[i]
		xj, yj = xy[j]
		pq.append((xi - xj, yi - yj)) j range(i+1,n) range i+1 i 1 n if i==j:
			continue
		 i==j i j continue xi, yi = xy[i] xi xy[i] xy i yi xj, yj = xy[j] xj xy[j] xy j yj pq.append((xi - xj, yi - yj)) pq.append pq append (xi - xj, yi - yj) xi - xj xi xj yi - yj yi yj ans = n ans n for p, q in pq:
	cost = 0
	for x, y in xy:
		if (x + p, y + q) in xy:
			pass
		else:
			cost += 1
	ans = min(ans, cost) p q pq cost = 0 cost 0 for x, y in xy:
		if (x + p, y + q) in xy:
			pass
		else:
			cost += 1
	 x y xy if (x + p, y + q) in xy:
			pass
		else:
			cost += 1
	 (x + p, y + q) in xy (x + p, y + q) x + p x p y + q y q xy cost += 1 cost 1 ans = min(ans, cost) ans min(ans, cost) min ans cost print(ans) print ans cost += 1 1 cost pq = [] [] pq yi = xy[i] xy[i] yi xj, yj = xy[j] xy[j] xj ans = min(ans, cost) min(ans, cost) ans n = int(input()) int(input()) n xi, yi = xy[i] xy[i] xi yj = xy[j] xy[j] yj ans = n n ans cost = 0 0 cost xy = [tuple(map(int, input().split())) for _ in range(n)] [tuple(map(int, input().split())) for _ in range(n)] xy
n = int(input())
xy = [tuple(map(int, input().split())) for _ in range(n)]
pq = []
for i in range(n):
	for j in range(i+1,n):
		if i==j:
			continue
		xi, yi = xy[i]
		xj, yj = xy[j]
		pq.append((xi - xj, yi - yj))
ans = n
for p, q in pq:
	cost = 0
	for x, y in xy:
		if (x + p, y + q) in xy:
			pass
		else:
			cost += 1
	ans = min(ans, cost)
print(ans)