#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll mod = 1000000007;

ll r(ll x, ll y) {
  if (y == 0) return 1;
  else if (y % 2 == 0) return r(x, y/2) * r(x, y/2) % mod;
  else return x * r(x, (y-1)/2) % mod * r(x, (y-1)/2) % mod;
}

int main() {
  int n;
  cin >> n;
  vector<bool> f(n, 0);
  vector<pair<double, double>> z(n);
  for (int i = 0; i < n;i++) {
    double a, b;
    cin >> a >> b;
    z[i] = make_pair(a, b);
  }
  int m = 2;
  for (int i = 0; i < n-2; i++) {
    int c = 2;
    double ix,iy;
    tie(ix, iy) = z[i];
    
    for (int j = i + 1; j < n - 1; j++) {
      double jx,jy;
      tie(jx, jy) = z[j];
      bool f = 0;
      if (jx - ix == 0) f = 1;
      
      for (int k = j + 1; k < n ; k++) {
        double kx, ky;
        tie(kx, ky) = z[k];
        if (f) {
          if (kx - ix == 0) c++;
        }
        else {
          if (kx - ix != 0) {
            if ((ky-iy)/(kx-ix) == (jy-iy)/(jx-ix)) c++;
          }
        }
      }
      m = max(m, c);
    }
  }
  cout << m <<endl;
}