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

using i64 = long long;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    auto solve = [&]() {
        int n;
        cin >> n;

        vector<int> s(n), v(n);
        for (int i = 0; i < n; i++) {
            cin >> s[i] >> v[i];
        }

        // (xk(t) - xj(t)) / (j - i) = (xj(t) - xi(t)) / (j - i)

        int ans = 0;

        for (int i = 0; i < n; i++) {
            for (int j = i + 1; j < n; j++) {
                map<pair<int, int>, int> mp;
                int same = 2, mx = 0;
                for (int k = 0; k < n; k++) {
                    if (k != i && k != j) {
                        int num = (s[k] - s[j]) * (j - i) - (s[j] - s[i]) * (k - j);
                        int den = (v[k] - v[j]) * (j - i) - (v[j] - v[i]) * (k - j);
                        den = -den;
                        if (den == 0) {
                            if (num == 0) {
                                same++;
                            }
                        } else {
                            int g = gcd(num, den);
                            num /= g, den /= g;
                            if (den < 0) {
                                num = -num, den = -den;
                            }
                            if (num >= 0) {
                                mx = max(mx, ++mp[pair(num, den)]);
                            }
                        }
                    }
                }
                ans = max(ans, same + mx);
            }
        }

        cout << ans << '\n';
    };
    
    solve();
    
    return 0;
}