翻译===

OpenJudge - 1118:Lining Up

1118:Lining Up

描述

"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!

输入

Input consist several case,First line of the each case is an integer N ( 1 < N < 700 ),then follow N pairs of integers. Each pair of integers is separated by one blank and ended by a new-line character. The input ended by N=0.

输出

output one integer for each input case ,representing the largest number of points that all lie on one line.

描述

“我该怎么解决这个问题？”飞行员说。

事实上，飞行员面临的任务并不轻松。她不得不把包裹扔到散落在危险区域的特定地点。此外，飞行员只能直线飞越该区域一次，她必须飞越尽可能多的点。所有点都是通过二维空间中的整数坐标给出的。飞行员想知道给定集合中位于同一条线上的最大点数。你能写一个程序来计算这个数字吗？

你的程序必须高效！

输入

输入由几个案例组成，每个案例的第一行是一个整数N（1<N<700），然后是N对整数。每对整数由一个空格分隔，并以一个新行字符结束。输入以N=0结束。

输出

为每个输入案例输出一个整数，表示所有位于一条线上的最大点数。