#include <complex>
#include <iostream>
#include <algorithm>
#include <vector>
#define EPS (1e-10)
using namespace std;

typedef complex<double> P;

// 内積 (dot product) : a⋅b = |a||b|cosθ
double dot(P a, P b) {
  return (a.real() * b.real() + a.imag() * b.imag());
}
// 外積 (cross product) : a×b = |a||b|sinθ
double cross(P a, P b) {
  return (a.real() * b.imag() - a.imag() * b.real());
}

// a1,a2を端点とする線分とb1,b2を端点とする線分の交差判定
int is_intersected_ls(P a1, P a2, P b1, P b2) {
  return ( cross(a2-a1, b1-a1) * cross(a2-a1, b2-a1) < EPS ) &&
         ( cross(b2-b1, a1-b1) * cross(b2-b1, a2-b1) < EPS );
}

int main(void)
{
	int N;
	cin >> N;
	vector<P> start(N);
	vector<P> end(N);
	double ax, ay, bx, by;
	for(int i = 0; i < N; i++) {
		cin >> ax >> ay >> bx >> by;
		start[i] = P(ax, ay);
		end[i] = P(bx, by);
	}
	
	int max = 0;
	for(int i = -100; i < 100; i++) {
		int count = 0;
		for(int j = 0; j < N; j++) {
			if(is_intersected_ls(P(i, 100), P(i, -100), start[j], end[j]) == 1) {
				count++;
			}
		}
		if(max < count) {
			max = count;
		}
	}
	for(int i = -100; i < 100; i++) {
		int count = 0;
		for(int j = 0; j < N; j++) {
			if(is_intersected_ls(P(100, i), P(-100, i), start[j], end[j]) == 1) {
				count++;
			}
		}
		if(max < count) {
			max = count;
		}
	}
	cout << max << endl;
}