#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

#define EPS 1e-8
class V2{
public:
    double x, y;

    V2(){}
    V2(double x_, double y_):x(x_),y(y_){}

    bool operator<(const V2 &p) const{
        return x!=p.x?x<p.x:y<p.y;
    }
    V2 operator+(V2 p) const{
        return V2(add(x,p.x), add(y,p.y));
    }
    V2 operator-(V2 p) const{
        return V2(add(x,-p.x), add(y,-p.y));
    }
    double dist()const{
        return sqrt(x*x+y*y);
    }
private:
    double add(double a, double b)const{
        return abs(a+b)<EPS*(abs(a)+abs(b))?0:a+b;
    }
};
V2 operator *(double k, V2 p){
    p.x *= k;
    p.y *= k;
    return p;
}
double dot(const V2 & a, const V2 &b){
    return a.x*b.x + a.y*b.y;
}
double cross(const V2 &a, const V2 &b){
    return a.x * b.y - a.y * b.x;
}

bool colSegSeg(const V2 &a, const V2 &b, const V2 &c, const V2 &d){
    V2 ab = b - a, cd = d - c, ac = c - a;
    double k1, k2;
    if(fabs(cross(ab, cd)) < EPS) return 0;
    k1 = cross(ac, cd) / cross(ab, cd);
    k2 = cross(ac, ab) / cross(ab, cd);
    return !(k1 < 0 || k2 < 0 || k1>1 || k2>1);
}

double distSegPt(const V2 &a, const V2 &b, const V2 &p){
    V2 ab=b-a, ap=p-a, ba=a-b, bp=p-b;
    if(dot(ab, ap) < EPS) return ap.dist();
    if(dot(ba, bp) < EPS) return bp.dist();
    else return abs(cross(ab, ap) / ab.dist());
}

double distSegSeg(const V2 &a, const V2 &b, const V2 &c, const V2 &d){
    double res = numeric_limits<double>::max();
    if(colSegSeg(a, b, c, d)) res = 0.0;
    res = min(res, distSegPt(a, b, c));
    res = min(res, distSegPt(a, b, d));
    res = min(res, distSegPt(c, d, a));
    res = min(res, distSegPt(c, d, b));
    return res;
}

int N;
vi A, B, C, D;
const int R = 200;

int main(){
    cin >> N;
    A = B = C = D = vi(N);
    
    
    rep(i, N)cin >> A[i] >> B[i] >> C[i] >> D[i];
    vector<pii> P;
    rep(i, N){
        P.emplace_back(A[i], B[i]);
        P.emplace_back(C[i], D[i]);
    }
    sort(all(P));
    P.erase(unique(all(P)), P.end());

    int ans = min(2, N);
    rep(i, sz(P))FOR(j, i + 1, sz(P)){
        int ax, ay, bx, by;
        tie(ax, ay) = P[i];
        tie(bx, by) = P[j];
        int dx = ax - bx, dy = ay - by;
        ax += dx * R;
        ay += dy * R;
        bx -= dx * R;
        by -= dy * R;
        V2 S(ax, ay), T(bx, by);

        int tmp = 0;
        rep(k, N){
            tmp += distSegSeg(S, T, V2(A[k], B[k]), V2(C[k], D[k])) < EPS;
        }
        smax(ans, tmp);
    }
    cout << ans << endl;
}