Problem:
Score : 300 points

Problem Statement

There are N balls in a two-dimensional plane. The i-th ball is at coordinates (x_i, y_i).

We will collect all of these balls, by choosing two integers p and q such that p \neq 0 or q \neq 0 and then repeating the following operation:

Choose a ball remaining in the plane and collect it. Let (a, b) be the coordinates of this ball. If we collected a ball at coordinates (a - p, b - q) in the previous operation, the cost of this operation is 0. Otherwise, including when this is the first time to do this operation, the cost of this operation is 1.

Find the minimum total cost required to collect all the balls when we optimally choose p and q.

Constraints

1 \leq N \leq 50

|x_i|, |y_i| \leq 10^9

If i \neq j, x_i \neq x_j or y_i \neq y_j.

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
x_1 y_1
:
x_N y_N

Output

Print the minimum total cost required to collect all the balls.

Sample Input 1

2
1 1
2 2

Sample Output 1

1

If we choose p = 1, q = 1, we can collect all the balls at a cost of 1 by collecting them in the order (1, 1), (2, 2).

Sample Input 2

3
1 4
4 6
7 8

Sample Output 2

1

If we choose p = -3, q = -2, we can collect all the balls at a cost of 1 by collecting them in the order (7, 8), (4, 6), (1, 4).

Sample Input 3

4
1 1
1 2
2 1
2 2

Sample Output 3

2

Solution in Ruby (2.3.3) (judge verdict: Runtime Error)

n = gets.to_i
balls = []

n.times do
  balls << gets.split.map(&:to_i)
end

gaps = []

for i in 0 .. n - 2
  for j in i + 1 .. n - 1
    gaps << [balls[j][0] - balls[i][0], balls[j][1] - balls[i][1]]
  end
end

gaps.sort!

cnt  = 0
max  = 0
last = [gaps[0][0], gaps[0][1]]
gmax = [gaps[0][0], gaps[0][1]]

for i in 1 .. gaps.size - 1
  cnt += 1
  if i == gaps.size - 1 || last[0] != gaps[i][0] || last[1] != gaps[i][1]
    if max < cnt
      max  = cnt
      gmax = [last[0], last[1]]
    end
    cnt = 0
  end
end

#p gaps, gmax 

puts n - gaps.count(gmax)