#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<=int(b);++i)
using namespace std;
template<class A>void pr(A a){cout << (a) << endl;}
template<class A,class B>void pr(A a,B b){cout << a << " "  ;pr(b);}
template<class A,class B,class C>void pr(A a,B b,C c){cout << a << " " ;pr(b,c);}
template<class A,class B,class C,class D>void pr(A a,B b,C c,D d){cout << a << " " ;pr(b,c,d);}
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
int INF=numeric_limits<int>::max();
// for(int j=0;j<N;++j) {

int main(void) {
  int n;cin>>n;
  vector<i_i> xy;
  int x,y;
  rep(i,0,n-1) {
    cin>>x>>y;
    xy.push_back({x,y});
  }

  unordered_map<double, unordered_map<double, ll>> M;

  rep(i,0,n-1) {
    rep(j,i+1,n-1) {
      i_i f,l;
      f = xy[i];
      l = xy[j];

      int x1,x2,y1,y2;
      x1 = f.first;
      y1 = f.second;
      x2 = l.first;
      y2 = l.second;

      double a,b;

      if(x2-x1==0) {
        a = 10000;
      } else {
        a = (1.0*(y2-y1))/(x2-x1);
      }
      b = (1.0*(x2*y1-x1*y2))/(x2-x1);

      M[a][b]++;
    }
  }

  ll ans=0;

  for(auto m:M) {
    for(auto m1:m.second) {
      ans = max(ans, m1.second);
    }
  }

  ans = sqrt(8*ans+1)/2.0 + 0.5;
  pr(ans);

  return 0;
}