#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#include<limits.h>
#include<float.h>
#include<list>
#include <array>
#include <complex>
#include<stdio.h>
#include<string.h>
#include <bitset>
#include<assert.h>

using namespace std;
#define int long long

#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007


#define MEM_SIZE 10000
#define DEBUG_OUT true
#define ALL(x) (x).begin(), (x).end()

template<typename T> void DEBUG(T e){if(DEBUG_OUT == false)return; std::cout << e <<" ";}
template<typename T> void DEBUG(const std::vector<T>& v){if(DEBUG_OUT == false)return;for(const auto& e : v){std::cout<< e << " "; } std::cout << std::endl;}
template<typename T> void DEBUG(const std::vector<std::vector<T> >& vv){if(DEBUG_OUT == false)return;for(const auto& v : vv){ DEBUG(v); } }
template<class T,class... Ts> void DEBUG(T d, Ts... e){if(DEBUG_OUT == false)return;DEBUG(d);DEBUG(e...);}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; abort();}}
template< typename T1, typename T2 > inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template< typename T1, typename T2 > inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }



void solve(void)
{
  int N;cin>>N;
  vector<pair<int,int> > vp;
  for (int i = 0; i < N; i++)
  {
    int X,Y;
    cin>>X>>Y;
    vp.emplace_back(X,Y);
  }
  int MAX = 0;
  for (int i = 0; i < N; i++)
  {
    int px = vp[i].first;
    int py = vp[i].second;
    map<pair<int,int> ,int> mp;
    for (int j = 0; j < N; j++)
    {
      if(i == j)continue;
      int rx = vp[j].first;
      int ry = vp[j].second;
      int qx = rx - px;
      int qy = ry - py;

      int GCD = gcd(qx,qy);
      qx /= GCD;
      qy /= GCD;

      if(qx < 0)
      {
        qx *= -1;
        qy *= -1;
      }
      mp[make_pair(qx,qy)]++;
    }
    for (auto &&(x) : mp)
    {
      chmax(MAX,x.second);
    }
    
  }
  
  cout<<MAX + 1<<endl;
  return;
}
int32_t main(int32_t argc, const char *argv[])
{
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);

  std::cout << std::fixed;
  std::cout << std::setprecision(11);
  solve();

  return 0;
}