#include <iostream>
#include <vector>
#include <numeric>
#include <map>

void solve() {
    int n;
    std::cin >> n;

    std::vector<std::pair<int, int>> ps(n);
    for (auto& p : ps) std::cin >> p.first >> p.second;

    int ans = 0;
    for (int i = 0; i < n; ++i) {
        std::map<std::pair<int, int>, int> cnt;

        for (int j = 0; j < n; ++j) {
            if (i == j) continue;
            int dx = ps[i].first - ps[j].first,
                dy = ps[i].second - ps[j].second;
            int g = std::gcd(dx, dy);
            dx /= g, dy /= g;
            if (dx < 0) {
                dx = -dx;
                dy = -dy;
            }

            ++cnt[std::make_pair(dx, dy)];
        }

        for (auto p : cnt) ans = std::max(ans, p.second + 1);
    }

    std::cout << ans << std::endl;
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}