Given a set of points in 2D space, each with integer x and y coordinates, find the largest number K of points lying exactly on the same line.
Input:
The input file contains an unknown number of data points
sets. Every set is preceded by an integer n specifying the number
of points in that set. If n is 0, then there are no more sets.
Each line in the file stores the x coordinate
and the y coordinate (in that order) separated by a space.
Output:
The output file contains the number K for each
set in a separate line.
Sample Input File:
15
7 122
8 139
9 156
10 173
11 190
2 4
12 207
13 224
14 241
5 10
15 258
16 275
17 292
3 6
18 309
0
Output File:
12