#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000000000000009;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);

bool isis_ls(P p1, P p2, P q1, P q2) {
	if (p1 > p2)swap(p1, p2);
	if (q1 > q2)swap(q1, q2);
	if (p1.first == p2.first) {
		if (q1.first <= p1.first && p1.first <= q2.first) {
			if (q1.first == q2.first) {
				int ly = max(p1.second, q1.second);
				int ry = min(p2.second, q2.second);
				return ly <= ry;
			}
			else {
				int y = (q2.second - q1.second) * (p1.first - q1.first) + (q2.first - q1.first) * q1.second;
				return (q2.first - q1.first) * p1.second <= y && y <= (q2.first - q1.first) * p2.second;
			}
		}
		else return false;
	}
	else {
		int y = (p2.second - p1.second) * (q1.first - p1.first) + (p2.first-p1.first)*p1.second;
		bool b1[2] = {}, b2[2] = {};
		if (y >= q1.second * (p2.first - p1.first))b1[0] = true;
		if (y <= q1.second * (p2.first - p1.first))b1[1] = true;
		y= (p2.second - p1.second) * (q2.first - p1.first) + (p2.first - p1.first) * p1.second;
		if (y >= q2.second * (p2.first - p1.first))b2[0] = true;
		if (y <= q2.second * (p2.first - p1.first))b2[1] = true;
		if (b1[0] && b2[1])return true;
		else if (b1[1] && b2[0])return true;
		else return false;
	}
}
void solve() {
	int n; cin >> n;
	vector<vector<int>> x(n), y(n);
	rep(i, n) {
		x[i].resize(2); y[i].resize(2);
		rep(j, 2)cin >> x[i][j] >> y[i][j];
	}
	if (n == 1) {
		cout << 1 << "\n"; return;
	}
	int ans = 0;
	rep(i, n)Rep(j, i + 1, n) {
		rep(k, 2)rep(l, 2) {
			int x1 = x[i][k], y1 = y[i][k], x2 = x[j][l], y2 = y[j][l];
			int cnt = 0;
			rep(t, n) {
				if (isis_ls({ x1,y1 }, { x2,y2 }, { x[t][0],y[t][0] }, { x[t][1],y[t][1] }))cnt++;
			}
			ans = max(ans, cnt);
		}
	}
	cout << ans << "\n";
}


signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(10);
	//init_f();
	//expr();
	//int t; cin >> t; rep(i, t)
	//while (cin >> n >> m>>s1>>s2>>t, n)
	solve();
	return 0;
}