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

int cross(int ax, int ay, int bx, int by) {
  return ax * by - ay * bx;
}

int main() {
  int n; cin >> n;
  vector<int> x(n), y(n);
  REP (i, n) cin >> x[i] >> y[i];

  int ret = 0;
  REP (i, n) REP (j, i) {
    int tmp = 0;
    REP (k, n) {
      if (cross(x[j]-x[i], y[j]-y[i], x[k]-x[i], y[k]-y[i]) == 0)
        ++tmp;
    }
    ret = max(ret, tmp);
  }
  cout << ret << endl;
}