#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define P pair<int, int>

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

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


}