#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

#define MOD (long long)(1e9+7)
#define REP(i,n) for(ll i = 0; i < n; i++)
#define REP1(i,n) for(ll i = 1; i <= n; i++)

ll gcd(ll a, ll b)
{
  if(b == 0) return a;
  return gcd(b, a % b);
}

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

  ll max_c = 0;
  REP(i, n) {
    for(ll j = i + 1; j < n; j++) {
      ll cnt = 0;
      ll dx = x[j]-x[i];
      ll dy = y[j]-y[i];
      REP(k, n) {
	if(dx*(y[k]-y[i]) == dy*(x[k]-x[i])) {
	  cnt ++;
	}
      }
      max_c = max(max_c, cnt);
    }
  }
  cout << max_c << endl;
}