#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(int)(n); i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;

int main(){
  int n; cin >> n;
  vector<double> x(n);
  vector<double> y(n);
  rep(i,n) {
    cin >> x[i] >> y[i];
  }
  int ans = 0;
  
  rep(i,n) {
    rep(j,n) {
      if (i==j) continue;
      int cnt=0;
      int dy = (y[j] - y[i]);
      int dx = (x[j] - x[i]);
      double a1 = abs((y[j] - y[i]) / (x[j] - x[i]));
      rep(k,n) {
        int dy2 = (y[k] - y[i]);
        int dx2 = (x[k] - x[i]);
        // dy/dx == dy2/dx;
        if (dy*dx2 == dy2*dx) cnt++;
      }
    ans = max(cnt, ans);
    }
  }
  cout << ans << endl;
}