#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <cstring>

typedef long long ll;
using namespace std;

#define mod 1000003
#define INF 1000000000
#define LLINF 2000000000000000000LL

#define SIZE 100
#define EPS 1e-12


int n,x[2][SIZE],y[2][SIZE];
int ans=1;

bool cross(int x1,int y1,int x2,int y2,int x3,int y3,int x4,int y4){
    ll a,b;
    
    /*直線(x3,y3,x4,y4) と 線分(x1,y1,x2,y2)*/
    
    a=(x3-x4)*(y1-y3)+(y3-y4)*(x3-x1);
    b=(x3-x4)*(y2-y3)+(y3-y4)*(x3-x2);
    
    /*直線(x1,y1,x2,y2) と 線分(x3,y3,x4,y4)*/
    
    //c=(long long)(x1-x2)*(y3-y1)+(long long)(y1-y2)*(x1-x3);
    //d=(long long)(x1-x2)*(y4-y1)+(long long)(y1-y2)*(x1-x4);
    
    
    
    if(((a<0)^(b<0) || ((a==0 || b==0)&& a+b!=0)))
        return true;
    else
        return false;
}

int calc(int a,int ak,int b,int bk){
    int cc = 2;
    
    
    for(int i=0;i<n;i++){
        if(i==a || i==b) continue;
        
        if(cross(x[0][i],y[0][i],x[1][i],y[1][i],x[ak][a],y[ak][a],x[bk][b],y[bk][b]))
            cc++;
    }
    
    return cc;
}

int main(){
    
    scanf("%d",&n);
    
    for(int i=0;i<n;i++){
        scanf("%d%d%d%d",&x[0][i],&y[0][i],&x[1][i],&y[1][i]);
    }
    
    for(int i=0;i<n;i++){
        for(int j=i+1;j<n;j++){
            
            ans = max(ans,calc(i,0,j,0));
            ans = max(ans,calc(i,1,j,0));
            ans = max(ans,calc(i,0,j,1));
            ans = max(ans,calc(i,1,j,1));

        }
    }
    
    printf("%d\n",ans);
    
    return 0;
}