#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("YES");}else{puts("NO");}
#define MAX_N 200005

int main() {
    int n;
    cin >> n;
    int x[n], y[n];
    rep(i,n)cin >> x[i] >> y[i];
    vector<P> v;
    rep(i,n)v.push_back(P(x[i], y[i]));
    sort(v.begin(), v.end());

    rep(i,n){
        x[i] = v[i].first;
        y[i] = v[i].second;
    }

    int ans = 2;

    rep(i,n-1){
        srep(j,i+1,n){
            int tmp = 2;
            srep(k,j+1,n){
                int a = x[j] - x[i];
                int b = y[j] - y[i];
                int c = x[k] - x[i];
                int d = y[k] - y[i];
                if(a*d==b*c)tmp++;
            }
            ans = max(ans, tmp);
        }
    }
    
    cout << ans << endl;
    return 0;
}