#include <sys/time.h>
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <random>
#include <cmath>
#include <algorithm>
#include <cassert>
#include <unordered_set>
#include <unordered_map>

using namespace std;

struct Point{
    int x;
    int y;
    Point(){}
    Point(int x_, int y_):x(x_),y(y_){}
};

int side(const Point& a1, const Point& a2, const Point& p){
    return (a2.x - a1.x) * (p.y - a1.y) - (a2.y - a1.y) * (p.x - a1.x);
}

bool cross(const Point& a1, const Point& a2, const Point& b1, const Point& b2){
    int s1 = side(a1, a2, b1) * side(a1, a2, b2);
    int s2 = side(b1, b2, a1) * side(b1, b2, a2);
    if(s1 <= 0 || s2 <= 0){
        return true;
    }
    return false;
}


int main(){
    int N;
    cin >> N;
    vector<pair<Point,Point> > line(N);
    for(int i = 0; i < N; i++){
        cin >> line[i].first.x;
        cin >> line[i].first.y;
        cin >> line[i].second.x;
        cin >> line[i].second.y;
    }
    int ans = 0;
    for(int dx = 0; dx <= 100; dx++){
        for(int sx = 0; sx <= 100; sx++){
            for(int sy = 0; sy <= 100; sy++){
                int cnt = 0;
                Point ps(sx, sy);
                Point pe(sx + dx, sy + 100);
                Point pe2(sx + 100, sy + dx);
                for(int i = 0; i < N; i++){
                    if(cross(line[i].first, line[i].second, ps, pe)) cnt++;
                }
                ans = max(ans, cnt);
                cnt = 0;
                for(int i = 0; i < N; i++){
                    if(cross(line[i].first, line[i].second, ps, pe2)) cnt++;
                }
                ans = max(ans, cnt);
            }
        }
    }
    cout << ans << endl;
    return 0;

}