#include <iostream>
#include <vector>
#include <string>
#include <utility>
#include <algorithm>
#include <climits>
#include <map>

using namespace std;

int main() {
    int n;
    cin >> n;
    vector x(n,0);
    vector y(n, 0);

    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 dx = (x[i] - x[j]);
            int dy = (y[i] - y[j]);
            
            int tmp = 0;
            for (int k=0; k<n; k++) {
                int dx2 = (x[i] - x[k]);
                int dy2 = (y[i] - y[k]);
                // dy/dx == dy2/dx2 なら通る
                if (dy*dx2 == dy2*dx) tmp++;
            }
            ans = max(ans, tmp);
        }
    }
    cout << ans << endl;
}