UVA 270

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
using namespace std;
double x[710],y[710];
struct POINT{
	double x,y;
}p[710];
bool cmp(struct POINT a,struct POINT b)
{
	if(a.x==b.y) return a.y<b.y;
	return a.x<b.x;
}
int main()
{
	int T;
	cin>>T;getchar();getchar();
	while(T--){
		char t[20];
		int n=0;
		while(true){
			cin.getline(t,20);
			if(!strlen(t)) break;
			sscanf(t,"%lf%lf",&p[n].x,&p[n].y);
			n++;
		}
		sort(p,p+n,cmp);
		int ans=0;
		for(int i=0;i<n;i++) //if((n-i)>ans){
		{
			for(int j=i+1;j<n;j++){
				//if((n-j)<=ans) break;这里两处剪枝效果不大，也就十几毫秒的差别
				int total=2;
				if(fabs(p[i].x-p[j].x)<0.000001){
					for(int k=j+1;k<n;k++) if(fabs(p[k].x-p[i].x)<0.000001)
						total++;
				}
				else{
					double tk=(p[i].y-p[j].y)/(p[i].x-p[j].x);
					double b=p[i].y-p[i].x*(p[i].y-p[j].y)/(p[i].x-p[j].x);
					for(int k=j+1;k<n;k++)
						if(fabs(p[k].y-tk*p[k].x-b)<0.000001)
							total++;
				}
				if(total>ans) ans=total;
			}
		}
		cout<<ans<<endl;
		if(T) cout<<endl;
	}
	return 0;
}