#include <bits/stdc++.h> #define rep(i,n) for(int i=0;i<(int)(n);i++) using namespace std; using ll = long long ; using P = pair<int,int> ; using pll = pair<long long,long long>; constexpr int INF = 1e9; constexpr long long LINF = 1e18; constexpr int MOD = 1000000007; int main(){ int n; cin >> n; int ans = 2; vector<P> xy(n); rep(i,n) cin >> xy[i].first >> xy[i].second; rep(i,n)rep(j,i){ int res = 0; int a = xy[j].second - xy[i].second; int b = xy[i].first - xy[j].first; int c = xy[j].first * xy[i].second - xy[i].first * xy[j].second; rep(k,n){ if(a*xy[k].first+b*xy[k].second+c == 0) ++ res; } ans = max(ans,res); } cout << ans << endl; return 0; }