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

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

  int res = 0;

  for (int i = 0; i < n; i++) {
    for (int j = i + 1; j < n; j++) {
      int tmp = 0;
      int dx = x[i] - x[j], dy = y[i] - y[j];
      for (int k = 0; k < n; k++) {
        int nx = x[i] - x[k], ny = y[i] - y[k];
        if (dy * nx == dx * ny) tmp++;
      }
      res = max(res, tmp);
    }
  }
  cout << res << endl;
  return 0;
}