#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int,int> P;

#define p_ary(ary,a,b) do { cout << "["; for (int count = (a);count < (b);++count) cout << ary[count] << ((b)-1 == count ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin();;++(it)) {if ((it) == map.end()) {cout << "}\n";break;}else cout << "" << (it)->first << "=>" << (it)->second << ", ";}}while(0)

template<typename T1,typename T2>ostream& operator<<(ostream& os,const pair<T1,T2>& a) {os << "(" << a.first << ", " << a.second << ")";return os;}

const char newl = '\n';

int main() {
    int n;
    cin >> n;
    vector<int> x(n),y(n);
    for (int i = 0;i < n;++i) cin >> x[i] >> y[i];
    int ans = 2;
    for (int i = 0;i < n;++i) for (int j = i+1;j < n;++j) {
        int cnt = 2;
        for (int k = j+1;k < n;++k) {
            if ((y[k]-y[j])*(x[k]-x[i]) == (y[k]-y[i])*(x[k]-x[j])) cnt++;
        }
        ans = max(ans,cnt);
    }
    cout << ans << endl;
}