#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define ll long long
using namespace std;
//typedef vector<unsigned int>vec;
//typedef vector<ll>vec;
//typedef vector<vec> mat;
typedef pair<int, int> P;
typedef pair<ll,ll> LP;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int INF = 1000000000;
const ll LINF = 1000000000000000000;//1e18
const ll  MOD = 1000000007;
const double PI = acos(-1.0);
const double EPS = 1e-10;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
//template<class T> inline void add(T &a, T b){a = ((a+b) % MOD + MOD) % MOD;};


void solve(){
    int N;
    cin >> N;
    vector<int> x(N), y(N);
    int ma = 0;
    REP(i,N) cin >> x[i] >> y[i];
    REP(i,N) for(int j=i+1;j<N;j++){
        int dx = x[j] - x[i], dy = y[j] - y[i];
        if(dx < 0) dx *= -1, dy *= -1;
        int g = gcd(dx, dy);
        if(dx == 0) dy = 1;
        else if(dy == 0) dx = 1;
        else dx /= g, dy /= g;
        int tmp = 2;
        REP(k,N) if(k != i && j != k){
            int ddx = x[k] - x[i], ddy = y[k] - y[i];
            if(ddx < 0) ddx *= -1, ddy *= -1;
            int gg = gcd(ddx, ddy);
            if(ddx == 0) ddy = 1;
            else if(ddy == 0) ddx = 1;
            else ddx /= gg, ddy /= gg;
            if(ddx == dx && ddy == dy) tmp++;
        }
        chmax(ma, tmp);
    }
    cout << ma << endl;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    // int T; cin >> T; REP(t,T) solve();
}