#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using Graph=vector<vector<pair<int,int>>>;
#define INF 1000000000000000000
#define MOD 1000000007

int main(){
  int N;
  cin>>N;
  vector<int> X(N),Y(N);
  for(int i=0;i<N;i++){
    cin>>X.at(i)>>Y.at(i);
  }

  int ans=0;
  for(int i=0;i<N;i++){
    for(int j=i+1;j<N;j++){
      int dx=X.at(j)-X.at(i);
      int dy=Y.at(j)-Y.at(i);
      int sum=2;
      for(int k=0;k<N;k++){
        if(k==i||k==j){
          continue;
        }
        if(dx*(Y.at(k)-Y.at(i))==dy*(X.at(k)-X.at(i))){
          sum++;
        }
      }
      ans=max(ans,sum);
    }
  }
  cout<<ans<<endl;
}