#include <bits/stdc++.h>
#define int long long
using namespace std;
const int MOD = 1000000007;
using Graph = vector<vector<int>>;

signed 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];
  
  int ans = 0;
  for( int i = 0; i < N; i++ ){
    for( int j = i+1; j < N; j++ ){
      int dx = X[i] - X[j];
      int dy = Y[i] - Y[j];
      int now = 0;
      for( int k = 0; k < N; k++ ){
        if( dx*(Y[i]-Y[k]) == (X[i]-X[k])*dy ) now++;
      }
      ans = max(ans, now);
    }
  }
  cout << ans << endl;
  
  
}