#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <cmath>
#include <numeric>
#include <utility>
#include <iomanip>

using namespace std;
using int64 = long long;
using P = pair<int, int>;

struct aaa{aaa(){cin.tie(nullptr); ios::sync_with_stdio(false); cout<<fixed<<setprecision(20);};}aaa;

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 = 0;
    for (int i=0; i<n; i++) {
        for (int j=i+1; j<n; j++) {
            int cnt = 2;
            for (int k=0; k<n; k++) {
                if (k==i || k==j) continue;
                if ((x[j]-x[i])*(y[k]-y[i]) == (y[j]-y[i])*(x[k]-x[i]))
                    cnt++;
            }
            ans = max(ans, cnt);
        }
    }
    cout << ans << endl;
}