#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#include <atcoder/all>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}

int main(){
  int N; cin >> N;
  vector<ll> X(N),Y(N);
  rep(i,N) cin >> X[i] >> Y[i];
  int ans = 0;
  rep(i,N){
    rep(j,i){
      ll dx = X[i]-X[j];
      ll dy = Y[i]-Y[j];
      int cnt=0;
      rep(k,N){
        ll dx2=X[i]-X[k];
        ll dy2=Y[i]-Y[k];
        if(dx*dy2-dy*dx2==0) cnt++;
      }
      chmax(ans,cnt);
    }
  }
  cout << ans << endl;
  return 0;
}