#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<ll> x(n), y(n);
    rep(i, n) cin >> x[i] >> y[i];
    ll ans = 0;
    rep(i, n) {
        reps(j, i + 1, n) {
            // 直線の式をy = (a / b)x + cと見立てる
            ll dx = x[i] - x[j];
            ll dy = y[i] - y[j];
            ll tmp = 0;
            if (dx == 0) {
                rep(k, n) {
                    if (x[k] == x[i]) tmp++;
                }
            }
            else {
                if (dx < 0) {
                    dx *= -1;
                    dy *= -1;
                }
                ll b = dx / __gcd(dx, dy);
                ll a = dy / __gcd(dx, dy);
                // cは求めず、x[i]に傾きを足したものとする
                rep(k, n) {
                    ll dx2 = x[k] - x[i];
                    if (dx2 % b != 0) continue;
                    ll dy2 = dx2 / b * a;
                    if ((y[k] - y[i]) == dy2) tmp++;
                }
            }
            ans = max(ans, tmp);
        }
    }
    cout << ans << endl;
    return 0;
}