#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define pf push_front
#define sec second
#define sz(x) ((int)(x).size())
#define ALL( c ) (c).begin(), (c).end()
#define gcd(a,b) __gcd(a,b)
#define mem(x,n) memset(x,n,sizeof(x))
#define endl "\n"
using namespace std;
template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}
template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); deploy<POS + 1, TUPLE, Ts...>(os, t); }
template <class T,class U> std::ostream& operator<<(std::ostream &os, std::pair<T,U> &p){ os << "(" << p.first <<", " << p.second <<")";return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }
#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }
#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }
#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }
#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }
using ll = long long;

int N;
pair <int,int> p1[110];
pair <int,int> p2[110];

int cross(int i, double l, double m){
  double y1 = l * p1[i].fir + m;
  double y2 = l * p2[i].fir + m;
  return (y1 - p1[i].sec) * (y2 - p2[i].sec) <= EPS;
}

int calc(pair <int,int> a, pair <int,int> b){
  if (a.fir > b.fir) {
    swap(a,b);
  }
  int ret = 0;
  if (a.fir != b.fir) {
    double l = 0;
    double m = 0;
    l = (double) (b.sec - a.sec) / (b.fir - a.fir);
    m = a.sec - l * a.fir;
    rep(i,N){
      ret += cross(i,l,m);
    }
  }else{
    rep(i,N){
      ret += p1[i].fir <= a.fir + EPS && a.fir <= p2[i].fir + EPS;
    }
  }
  return ret;
}

int main()
{
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cin >> N;
  rep(i,N){
    cin >> p1[i].fir >> p1[i].sec;
    cin >> p2[i].fir >> p2[i].sec;
    if (p1[i].fir > p2[i].fir) {
      swap(p1[i],p2[i]);
    }
  }
  int ans = 0;
  rep(i,N){
    rep(j,N){
      ans = max(ans, calc(p1[i],p2[j]));
      if (i != j) {
        ans = max(ans, calc(p1[i],p1[j]));
        ans = max(ans, calc(p2[i],p2[j]));
      }
    }
  }

  cout << ans << endl;
  return 0;
}