#include #define all(v) v.begin(), v.end() #define rall(v) v.rbegin(), v.rend() #define rep(i,n) for(int i=0;i<(int)(n);i++) #define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++) #define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(int)(n);k++) #define codefor int test;scanf("%d",&test);while(test--) #define INT(...) int __VA_ARGS__;in(__VA_ARGS__) #define LL(...) ll __VA_ARGS__;in(__VA_ARGS__) #define yes(ans) if(ans)printf("yes\n");else printf("no\n") #define Yes(ans) if(ans)printf("Yes\n");else printf("No\n") #define YES(ans) if(ans)printf("YES\n");else printf("NO\n") #define popcount(v) __builtin_popcount(v) #define vector2d(type,name,h,...) vector>name(h,vector(__VA_ARGS__)) #define vector3d(type,name,h,w,...) vector>>name(h,vector>(w,vector(__VA_ARGS__))) using namespace std; using ll = long long; template using rpriority_queue = priority_queue, greater>; const int MOD=1000000007; const int MOD2=998244353; const int INF=1<<30; const ll INF2=1LL<<60; void scan(int& a){scanf("%d",&a);} void scan(long long& a){scanf("%lld",&a);} templatevoid scan(pair& p){scan(p.first);scan(p.second);} templatevoid scan(tuple& p){scan(get<0>(p));scan(get<1>(p));scan(get<2>(p));} template void scan(T& a){cin>>a;} template void scan(vector& vec){for(auto&& it:vec)scan(it);} void in(){} template void in(Head& head, Tail&... tail){scan(head);in(tail...);} void print(const int& a){printf("%d",a);} void print(const long long& a){printf("%lld",a);} void print(const double& a){printf("%.15lf",a);} templatevoid print(const pair& p){print(p.first);putchar(' ');print(p.second);} template void print(const T& a){cout< void print(const vector& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}} void out(){putchar('\n');} template void out(const T& t){print(t);putchar('\n');} template void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);} template void dprint(const T& a){cerr< void dprint(const vector& vec){if(vec.empty())return;cerr< void debug(const T& t){dprint(t);cerr< void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<" ";debug(tail...);} ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; } ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; } ll modinv(ll a, ll m) {ll b = m, u = 1, v = 0;while (b) {ll t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;} ll updivide(ll a,ll b){return (a+b-1)/b;} template void chmax(T &a,const T b){if(b>a)a=b;} template void chmin(T &a,const T b){if(bEPS)return COUNTER_CLOCKWISE; if(cross(base,a)<-EPS)return CLOCKWISE; if(dot(base,a)<-EPS)return ONLINE_BACK; if((p2-p1).sqnorm() getCrossPoint(circle c,line l){ point pr=l.project(c.c); double prl=(pr-c.c).sqnorm(); if(prl<=c.r*c.r){ double t=sqrt(c.r*c.r-prl); if(abs(l.base.x)0)return make_pair(pr-l.base*t,pr+l.base*t); else return make_pair(pr+l.base*t,pr-l.base*t); }else{ if(l.base.x>0)return make_pair(pr-l.base*t,pr+l.base*t); else return make_pair(pr+l.base*t,pr-l.base*t); } } } //点と点の距離 double getDistance(point a,point b){return (b-a).norm();} //直線と点の距離 double getDistance(line l,point p){ return abs(cross(l.p2-l.p1,p-l.p1))/(l.p2-l.p1).norm(); } //線分と点の距離 double getDistanceSP(line s,point p){ if(dot(s.p2-s.p1,p-s.p1)<0)return getDistance(s.p1,p); if(dot(s.p1-s.p2,p-s.p2)<0)return getDistance(s.p2,p); return getDistance(s,p); } //線分と線分の距離 double getDistance(line s1,line s2){ if(intersect(s1,s2))return 0.0; return min(min(getDistanceSP(s1,s2.p1),getDistanceSP(s1,s2.p2)), min(getDistanceSP(s2,s1.p1),getDistanceSP(s2,s1.p2))); } }; int main(){ using namespace geometry; INT(n); vector A; vector> vec; rep(i,n){ INT(a,b,c,d); vec.push_back({a,b}); vec.push_back({c,d}); A.push_back(line(point(a,b),point(c,d))); } int ans=0,cnt; drep(i,j,vec.size()){ line s(point(vec[i].first,vec[i].second),point(vec[j].first,vec[j].second)); cnt=0; rep(k,n){ cnt+=(intersect(s,A[k])); } chmax(ans,cnt); } out(ans); }