#include <bits/stdc++.h>
using namespace std;
const double EPS = 0.0001;

struct rect{
    complex<double> l;
    complex<double> r;
    rect(double a,double b,double c,double d){
        l=complex<double>(a,b);
        r=complex<double>(c,d);
    }
};

double cross(complex<double> a, complex<double> b) {
  return (a.real() * b.imag() - a.imag() * b.real());
}

int is_intersected_ls(rect a, rect b) {
    return ( cross(a.r-a.l, b.l-a.l) * cross(a.r-a.l, b.r-a.l) < EPS ) &&
        ( cross(b.r-b.l, a.l-b.l) * cross(b.r-b.l, a.r-b.l) < EPS );
}

int main(void){
    vector<rect> v;
    vector<complex<double>> cv;
    double a,b,c,d;
    int i,j,k,n;
    cin>>n;
    for(i=0;i<n;i++){
        cin>>a>>b>>c>>d;
        v.emplace_back(a,b,c,d);
        cv.emplace_back(a,b);
        cv.emplace_back(c,d);
    }
    int mx=0;
    for(i=0;i<n*2;i++){
        for(j=0;j<n*2;j++){
            auto w = cv[i].real()-cv[j].real();
            auto h = cv[i].imag()-cv[j].imag();
            rect tmp(cv[i].real()-w*1000,cv[i].imag()-h*1000,cv[j].real()+w*1000,cv[j].imag()+h*1000);
            int count=0;
            for(k=0;k<n;k++){
                if(is_intersected_ls(tmp,v[k])) count++;
            }
            mx=max(mx,count);
        }
    }
    cout<<mx<<endl;
}