#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(n) begin(n), end(n)
using ll = long long;
using namespace std;

const double INF = 1001001001;

int main(){
  int n;
  cin >> n;
  map<double, int> m;
  vector<pair<int, int>> vp;
  rep(i, n){
    int a, b;
    cin >> a >> b;
    vp.push_back(make_pair(a, b));
  }
  int ans = 0;
  rep(i, vp.size()){
    auto now = vp.at(i);
    map<double, int> add;
    rep(j, vp.size()){
      if(i == j) continue;
      auto b = vp.at(j);
      double ab;
      if(now.first - b.first == 0){
        ab = INF;
      }else{
        ab = (double)(now.second - b.second)/(now.first - b.first);
      }
      add[ab]++;
    }
    for(auto p : add){
      ans = max(p.second, ans);
    }
  }
  cout << ans+1 << endl;
  return 0;
}