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

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++){
            if (X[i] == X[j])
                continue;
            int dx = X[i] - X[j];
            int dy = Y[i] - Y[j];

            int res = 0;
            for (int k = 0; k < n; k++){
                if (dy * (X[k] - X[i]) % dx != 0)
                    continue;
                int y = dy * (X[k] - X[i]) / dx + Y[i];
                if (y == Y[k])
                    res++;
            }
            ans = max(ans, res);
        }
    }

    for (int i = 0; i <= 100; i++){
        int res = 0;
        for (int j = 0; j < n; j++)
            if (X[j] == 0)
                res++;
        ans = max(ans, res);
        res = 0;
        for (int j = 0; j < n; j++)
            if (Y[j] == 0)
                res++;
        ans = max(ans, res);
    }

    cout << ans << endl;
}