#include<iostream>
#include<cmath>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
int N;
int A[100],B[100],C[100],D[100];
int cnt(double theta)
{
	vector<pair<double,double> >X;
	double c=cos(theta),s=sin(theta);
	for(int i=0;i<N;i++)
	{
		double L=A[i]*c-B[i]*s;
		double R=C[i]*c-D[i]*s;
		X.push_back(minmax(L,R));
	}
	sort(X.begin(),X.end());
	priority_queue<double>P;
	int ret=0;
	for(pair<double,double>p:X)
	{
		while(!P.empty()&&-P.top()<p.first-1e-10)P.pop();
		P.push(-p.second);
		ret=max(ret,(int)P.size());
	}
	return ret;
}
main()
{
	cin>>N;
	for(int i=0;i<N;i++)cin>>A[i]>>B[i]>>C[i]>>D[i];
	int ans=0;
	const int LIM=1e4;
	for(int i=0;i<LIM;i++)
	{
		ans=max(ans,cnt(M_PI*i/LIM));
	}
	cout<<ans<<endl;
}