// No.1041 直線大学
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(int)(n); i++)
using namespace std;
using ll = long long;
using ull = unsigned long long;

int main(){
    int n;
    cin >> n;
    vector<pair<int, int>> xy(n);
    rep(i, n) cin >> xy[i].first >> xy[i].second;
    int ans = 2;
    rep(i, n-1){
        for(int j=i+1; j<n; j++){
            int dx = xy[i].first-xy[j].first;
            int dy = xy[i].second-xy[j].second;
            int cnt = 0;
            rep(k, n){
                int dx2 = xy[i].first - xy[k].first;
                int dy2 = xy[i].second - xy[k].second;
                if(dy*dx2 == dy2*dx) cnt++;
            }
            ans = max(ans, cnt);
        }
    }
    cout << ans << endl;
    return 0;
}