#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <functional>
#include <bitset>

using namespace std;
using lint = long long int;
long long int INF = 1001001001001001LL;
int inf = 1000000007;
long long int MOD = 1000000007LL;
double PI = 3.1415926535897932;

template<typename T1,typename T2>inline void chmin(T1 &a,const T2 &b){if(a>b) a=b;}
template<typename T1,typename T2>inline void chmax(T1 &a,const T2 &b){if(a<b) a=b;}

#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()

/* do your best */

int main() {
  
  int n; cin >> n;
  vector<int> x(n);
  vector<int> y(n);
  for (int i = 0; i < n; i++) {
    cin >> x[i] >> y[i];
  }

  lint ans = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {

      lint tmp = 0;
      if (x[i] == x[j]) {
        for (int k = 0; k < n; k++) {
          if (x[k] == x[i]) tmp++;
        }
      } else if (y[i] == y[j]) {
        for (int k = 0; k < n; k++) {
          if (y[k] == y[i]) tmp++;
        }
      } else {
        for (int k = 0; k < n; k++) {
          if ((y[i] - y[j]) * (x[i] - x[k]) == (y[i] - y[k]) * (x[i] - x[j])) tmp++;
        }
      }
      ans = max(ans, tmp);
    }
  }
  cout << ans << endl;
  return 0;
}