#include <bits/stdc++.h> using namespace std; typedef long long int ll; typedef pair<ll, ll> P; typedef vector<ll> VI; typedef vector<VI> VVI; const ll MOD = 1000000007; const ll INF = 2147483647; const ll LINF = 9223372036854775807; #define REP(i, n) for (int i = 0; i < n; i++) #define ALL(v) v.begin(), v.end() int main() { int n; cin >> n; VI x(n), y(n); REP(i,n) cin >> x[i] >> y[i]; int ans=2; REP(i,n-1){ for(int j=i+1;j<n;j++){ int dx=x[j]-x[i]; int dy=y[j]-y[i]; double p=(double)dx/dy; int c=2; REP(k,n){ if(i!=k&&j!=k){ int ddx=x[k]-x[i]; int ddy=y[k]-y[i]; double pp=(double)ddx/ddy; if(pp==p) c++; } } ans=max(ans,c); } } cout << ans << endl; return 0; }