#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <queue>
#include <stack>

#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
typedef long long ll;

using namespace std;


int inputValue(){
    int a;
    cin >> a;
    return a;
};

void inputArray(int * p, int a){
    rep(i, a){
        cin >> p[i];
    }
};

void inputVector(vector<int> * p, int a){
    rep(i, a){
        int input;
        cin >> input;
        p -> push_back(input);
    }
}

template <typename T>
void output(T a, int precision) {
    if(precision > 0){
        cout << setprecision(precision)  << a << "\n";
    }
    else{
        cout << a << "\n";
    }
}

// point
class point{
public:
    int x;
    int y;
    point(int x, int y){
        this -> x = x;
        this -> y = y;
    }
};

// 直線mnが線分pqを貫くか？
bool isOnLine(point m, point n, point p, point q){
    bool ret = false;
    // 直線mnの方程式 ax + by + c = 0
    int a = n.y - m.y;
    int b = -(n.x - m.x);
    int c = n.x * m.y - m.x * n.y;
    
    int sp = a * p.x + b * p.y + c;
    int sq = a * q.x + b * q.y + c;
    
    if (sp * sq <= 0) {
        ret = true;
    }
    
    return ret;
}

vector<point> P;

int main(int argc, const char * argv[]) {
    
    // source code
    int N = inputValue();
    rep(i, 2 * N){
        P.push_back(point(inputValue(), inputValue()));
    }
    
    int ret = 0;
    if (N == 1) {
        ret = 1;
    }
    
    rep(i, 2 * N){
        rep(j, 2 * N){
            if (i == j) {
                continue;
            }
            if (P[i].x == P[j].x && P[i].y == P[j].y) {
                continue;
            }
            int pass = 0;
            rep(k, N){
                if (isOnLine(P[i], P[j], P[2 * k], P[2 * k + 1])) {
                    pass++;
                }
            }
            ret = max(ret, pass);
        }
    }
    
    output(ret, 0);
    
    return 0;
}