// I SELL YOU...! 
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<chrono>
#include<iomanip>
#include<map>
#include<set>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using TP = tuple<ll,ll,ll>;
void init_io(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(18);
}
signed main(){
  init_io();
  ll n,ans=0,dx,dy;
  cin >> n;
  vector<ll> x(n),y(n);
  for(int i=0;i<n;i++){
    cin >> x[i] >> y[i];
  }
  for(int i=0;i<n;i++){
    for(int j=i+1;j<n;j++){
      dy = y[j]-y[i];
      dx = x[j]-x[i];
      ll tmp = 0;
      for(int k=0;k<n;k++){
        if(dx*(y[k]-y[i])==dy*(x[k]-x[i])){
          tmp++;
        }
      }
      ans = max(ans,tmp);
    }
  }
  cout << ans << endl;
}