#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())
#define endl "\n"

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    ll n;
    cin >> n;
    vector<pair<ll, ll>> xy(n);
    rep(i, n) cin >> xy[i].first >> xy[i].second;
    ll ans = 0;
    rep(i, n) {
        reps(j, i + 1, n) {
            ll a;
            if (xy[i].first == xy[j].first) {
                continue;
            }
            else if (xy[i].first > xy[j].first) {
                a = (xy[i].second - xy[j].second) / (xy[i].first - xy[j].first);
            }
            else {
                a = (xy[j].second - xy[i].second) / (xy[j].first - xy[i].first);
            }
            ll b = xy[i].second - xy[i].first * a;
            ll tmp = 0;
            rep(k, n) {
                if ((a * xy[k].first + b) == xy[k].second) tmp++;
            }
            ans = max(ans, tmp);
        }
    }
    cout << ans << endl;
    return 0;
}