#include using namespace std; #define DEBUG(x) cerr<<#x<<": "< #define vl vector #define vii vector< vector > #define vll vector< vector > #define vs vector #define pii pair #define pis pair #define psi pair #define pll pair template pair operator+(const pair &s, const pair &t) { return pair(s.first + t.first, s.second + t.second); } template pair operator-(const pair &s, const pair &t) { return pair(s.first - t.first, s.second - t.second); } template ostream& operator<<(ostream& os, pair p) { os << "(" << p.first << ", " << p.second << ")"; return os; } #define X first #define Y second #define rep(i,n) for(int i=0;i<(int)(n);i++) #define rep1(i,n) for(int i=1;i<=(int)(n);i++) #define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--) #define rrep1(i,n) for(int i=(int)(n);i>0;i--) #define REP(i,a,b) for(int i=a;i bool chmax(T &a, const T &b) { if (a bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; } #define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end()); const ll inf = 1000000001; const ll INF = (ll)1e18 + 1; const long double pi = 3.1415926535897932384626433832795028841971L; #define Sp(p) cout<> n; vector xy(n); rep (i, n) { cin >> xy[i].first >> xy[i].second; } int ma = 0; rep (i, n) { rep (j, n) { if (i == j) continue; int x0 = xy[i].first, y0 = xy[i].second; int x1 = xy[j].first, y1 = xy[j].second; double a = (y1 - y0) / (double)(x1 - x0); int cnt = 2; rep (k, n) { if (i == k or j == k) continue; int x2 = xy[k].first, y2 = xy[k].second; double b = (y2 - y0) / (double)(x2 - x0); if (abs(a - b) < EPS) { cnt++; } } chmax(ma, cnt); } } cout << ma << endl; }