#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end())
using namespace std;

using ll = long long;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
const int INF = 1e9;
const long long INFL = 1LL<<60;

// 直線の式とvpと除外する点をもらって計算する
int calc(vector<pair<int, int>>& vp, int i, int j) {
  int x1 = vp[i].first;
  int y1 = vp[i].second;
  int x2 = vp[j].first;
  int y2 = vp[j].second;
  int ans = 0;
  for (int k = 0; k < vp.size(); k++) {
    if (k == i || k == j) continue;
    int x = vp[k].first;
    int y = vp[k].second;
    if ((x2 - x1) * (y - y1) == (y2 - y1) * (x - x1)) ans++;
  }
  return ans;
}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  int n; cin >> n;
  vector<pair<int, int>> vp(n);
  rep(i, n) {
    int x, y; cin >> x >> y;
    vp[i] = {x, y};
  }

  int ans = 0;
  for (int i = 0; i < n-1; i++) {
    for (int j = i+1; j < n; j++) {
      chmax(ans, 2 + calc(vp, i, j));
    }
  }

  cout << ans << endl;

  return 0;
}