#include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < (a); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
#define repr(i, a) for (int i = (a) - 1; i >= 0; i--)
#define repr2(i, a, b) for (int i = (b) - 1; i >= (a); i--)
using namespace std;
typedef long long ll;
const ll inf = 1e9;
const ll mod = 1e9 + 7;

typedef ll D;
typedef complex<D> P;
const D eps = 1e-8;

D dot(P a, P b) {
    return real(conj(a) * b);
}

D cross(P a, P b) {
    return imag(conj(a) * b);
}

int ccw(P a, P b, P c) {
    b -= a; c -= a;
    if (cross(b, c) > eps) return 1;
    if (cross(b, c) < -eps) return -1;
    if (dot(b, c) < -eps) return 2;
    if (norm(b) < norm(c)) return -2;
    return 0;
}

bool intersectSS(P p1, P p2, P p3, P p4) {
    return ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 &&
        ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0;
}

P ps[200];

int main() {
    int N;
    cin >> N;
    rep (i, N) {
        D x, y;
        cin >> x >> y;
        ps[i * 2] = P(x, y);
        cin >> x >> y;
        ps[i * 2 + 1] = P(x, y);
    }

    int ans = 0;
    rep (i, N * 2) rep (j, N * 2) {
        int cand = 0;
        rep (k, N) {
            if (intersectSS(ps[k * 2], ps[k * 2 + 1], ps[i], ps[j])) {
                cand++;
            }
        }
        ans = max(ans, cand);
    }

    cout << ans << endl;
}