#include<bits/stdc++.h>

using namespace std;
using ll = long long;


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