#include <bits/stdc++.h>
using namespace std;

int main(){
    int N;
    cin >> N;
    vector<int> X(N), Y(N);
    for(int i=0; i<N; i++) cin >> X[i] >> Y[i];
    int ans = 0;
    for(int i=0; i<N; i++){
        map<pair<int, int>, int> mp;
        for(int j=0; j<N; j++) if(i != j){
            int x = X[i] - X[j], y = Y[i] - Y[j];
            int g = gcd(abs(x), abs(y));
            if(x < 0) g *= -1;
            x /= g;
            y /= g;
            mp[{x, y}]++;
        }
        for(auto& p : mp) ans = max(ans, p.second+1);
    }
    cout << ans << endl;
    return 0;
}