#include #define rep(i,n) for (int i=0; i<(int)(n); i++) #define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++) using namespace std; using ll = long long; using P = pair; int main(){ int n; cin >> n; vector x(n); vector y(n); rep(i,n) { cin >> x[i] >> y[i]; } int ans = 0; rep(i,n) { int cnt; rep(j,n) { if (i==j) continue; cnt=1; if (x[j]==x[i]) { rep(k,n) {if (i!=k && j!=k && x[k]==x[i]) cnt++;} continue; } double a1 = abs((y[j] - y[i]) / (x[j] - x[i])); rep(k,n) { if (i==k || j==k) continue; if (x[k]==x[i]) {cnt++; continue;} double a2 = abs((y[k] - y[i]) / (x[k] - x[i])); if (abs(a1-a2) < 0.0001) cnt++; } } ans = max(cnt, ans); } cout << ans << endl; }