#include<iostream> #include<string> #include<vector> #include<algorithm> #include<bitset> #include<set> #include<map> #include<stack> #include<queue> #include<deque> #include<list> #include<iomanip> #include<cmath> #include<cstring> #include<functional> #include<cstdio> #include<cstdlib> #include<unordered_map> #include<unordered_set> using namespace std; #define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++) #define rep(i, n) repr(i, 0, n) #define INF 2e9 #define MOD 1000000007 //#define MOD 998244353 #define LINF (long long)4e18 #define jck 3.141592 #define PI acos(-1.0); const double EPS = 1e-10; using ll = long long; using Pi = pair<int,int>; using Pl = pair<ll,ll>; int main(){ int n; cin >> n; vector<int> x(n),y(n); rep(i,n){ cin >> x[i] >> y[i]; } int ans = 0; rep(i,n-1)repr(j,i+1,n){ int now = 0; rep(k,n){ if((y[j]-y[i])*(x[k]-x[j]) == (y[k]-y[j])*(x[j]-x[i])) now++; } ans = max(ans,now); } cout << ans << endl; }