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

int gcd(int x, int y) {
    if (x < 0 || y < 0) return gcd(abs(x), abs(y));
    if (x * y == 0) return x + y;
    return gcd(y, x % y);
}

int main() {
    int n;
    cin >> n;
    vector<int> x(n), y(n);
    for (int i = 0; i < n; i++) cin >> x.at(i) >> y.at(i);
    map<pair<int, int>, int> d;
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            int dx = x.at(j) - x.at(i), dy = y.at(j) - y.at(i), g = gcd(dx, dy);
            dx /= g; dy /= g;
            if (dy < 0 || (dy == 0 && dx < 0)) {
                d[make_pair(-dx, -dy)]++;
            } else {
                d[make_pair(dx, dy)]++;
            }
        }
    }
    int ans = 0, p = 0;
    for (auto x : d) {
        p = max(p, x.second);
    }
    while (ans * (ans - 1) / 2 < p) ans++;
    cout << ans << endl;
}