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: Accepted)

n = gets.to_i
ball = Array.new(n).map{Array.new(2,0)}
n.times{|i| ball[i] = gets.split.map(&:to_i)}
ball.sort!
ans = 0
for i in 0..n-1
  for j in 0..n-1
    if i != j
      count = 0
      inst0 = ball[j][0]-ball[i][0]
      inst1 = ball[j][1]-ball[i][1]
      for k in 0..n-1
        for l in 0..n-1
          if k != l && ball[l][0]-ball[k][0]==inst0 && ball[l][1]-ball[k][1]==inst1
            count += 1
          end
        end
      end
      if ans < count
        ans = count
      end
    end
  end
end
puts n-ans