#include<bits/stdc++.h>
using namespace std;
int gcd(int a,int b){
    if(b>a) swap(a,b);
    if(b==0) return a;
    return gcd(b,a%b);
}
int cx[101],cy[101];

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++){
        ans = max(ans,++cx[x[i]]);
        ans = max(ans,++cy[y[i]]);
    }
    for(int i = 0;i<n;i++){
        map<pair<int,int>,int> d;
        for(int j = 0;j<n;j++){
            if(i==j) continue;
            int dx = x[j] - x[i];
            int dy = y[j] - y[i];
            int g = gcd(abs(dx),abs(dy));
            dx/=g;dy/=g;
            if(dx*dy>=0){
                dx = abs(dx);
                dy = abs(dy);
            }else{
                dx = abs(dx);
                dy = -abs(dy);
            }
            ans = max(ans,++d[make_pair(dx,dy)]+1);
        }
    }
    cout<<ans<<endl;
}