#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printVec(v) printf("{"); for (const auto& i : v) { std::cout << i << ", "; } printf("}\n");
#define degreeToRadian(deg) (((deg)/360)*2*M_PI)
#define radianTodegree(rad) (((rad)/2/M_PI)*360)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
using namespace std;
using P = pair<int,int>;
using ll = long long;
const ll INF = 1LL<<60;
const int MOD = 1e9 + 7;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

//cin.tie(0);ios::sync_with_stdio(false);
//cout << fixed << setprecision(15) << y << endl;
int main() {
  int n;
  cin >> n;
  vector<int> X(n), Y(n);
  rep (i, n) cin >> X[i] >> Y[i];
  
  double x1, y1, x2, y2;
  
  if (n < 3) {
    cout << 2 << endl;
    return 0;
  }

  int ans = -1;
  rep (i, n) {
    x1 = X[i], y1 = Y[i];
    for (int j = i + 1; j < n; j++) {
      x2 = X[j], y2 = Y[j];
      double dx = (x2 - x1);
      double dy = (y2 - y1);
      int c1 = 0, c2 = 0, c3 = 0;
      rep (k, n) {
	if (k == i || k == j) continue;
	if ((dy * (X[k] - x1)) / dx + y1 == Y[k]) c1++;
	if (dx == 0 && x1 == X[k]) c2++;
	if (dy == 0 && y1 == Y[k]) c3++;
      }
      int tmp = max(c1, c2);
      tmp = max(tmp, c3);
      ans = max(ans, tmp);
    }
  }
  cout << ans + 2 << endl;
  return 0;
}