You are given points on the plane. You have the guarantee that there exists at least one line that contains at least of the given points. Find any such line.
Input consists of several cases, with only integer numbers, each one with , followed by different pairs . There is at least one line with at least of the given points. Assume , and that no given coordinate is larger than in absolute value.
For every case, print information about the line you found: The number of all the given points that belong to your line, followed by all those points in any order. The number must be at least 2 and also at least . If there is more than one possible line, choose any one. Follow strictly the format of the sample output.
Input
4 0 0 0 -1 -1 0 -1 -1 3 999991 999992 999992 999993 999993 999994 11 7 0 7 2 -7 2 6 4 -6 4 5 5 -5 5 3 6 -3 6 0 7 3 3
Output
2 0 -1 -1 0 3 999991 999992 999992 999993 999993 999994 3 7 2 -5 5 3 3