#include <bits/stdc++.h>
using namespace std;
struct point{
  int x;
  int y;
  point(){
  }
  point (int a, int b){
    x = a;
    y = b;
  }
  point operator -(point P){
    return point(x - P.x, y - P.y);
  }
};
long long cross(point P, point Q){
  return P.x * Q.y - P.y * Q.x;
}
int main(){
  int N;
  cin >> N;
  vector<point> P(N);
  for (int i = 0; i < N; i++){
    cin >> P[i].x >> P[i].y;
  }
  int ans = 0;
  for (int i = 0; i < N; i++){
    for (int j = i + 1; j < N; j++){
      int count = 0;
      for (int k = 0; k < N; k++){
        if (cross(P[j] - P[i], P[k] - P[i]) == 0){
          count++;
        }
      }
      ans = max(ans, count);
    }
  }
  cout << ans << endl;
}