#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
typedef long long ll;
typedef pair<ll,ll> pll;
typedef long double ld;
const ll inf=1e9+7;
const ll mod=1e9+7;
pair<ll,pll> line(ll x1,ll x2,ll y1,ll y2){
    ll a=y2-y1,b=x1-x2,c=(y1-y2)*x1+y1*(x2-x1);
    return mp(a,mp(b,c));
}
signed main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll n;cin>>n;
    vector<ll>x(n);
    vector<ll>y(n);
    rep(i,n){
        cin>>x[i]>>y[i];
    }
    vector<pair<ll,pll> >l(0);
    rep(i,n){
        REP(j,i+1,n){
            l.pb(line(x[i],x[j],y[i],y[j]));
        }
    }
    ll ans=2;
    rep(i,l.size()){
        ll cnt=0;
        ll a=l[i].first,b=l[i].second.first,c=l[i].second.second;
        rep(j,n){
            if(a*x[j]+b*y[j]+c==0)cnt++;
        }
        ans=max(ans,cnt);
    }
    cout<<ans<<endl;
}