| Program | |
``How am I ever going to solve this problem?'' said the pilot.
Indeed, the pilot was not facing an easy task. She had to drop packages at specific
points scattered in a dangerous area. Furthermore, the pilot could only fly
over the area once in a straight line, and she had to fly over as many points
as possible. All points were given by means of integer coordinates in a two-dimensional
space. The pilot wanted to know the largest number of points from the given
set that all lie on one line. Can you write a program that calculates this number?
Your program has to be efficient!
The input file will contain one or more test cases. Each test case consists of a number N, where 1 < N < 3000, followed by N pairs of (16-bit) integers. Each pair of integers is separated by one blank and ended by a new-line character. No pair will occur twice. in the same test case. Input is terminated by N=0.
The output consists of one integer per test case representing the largest number of points that all lie on one line.
Sample Input
5
1 1
2 2
3 3
9 10
10 11
0
Expected Output
3