#include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++)
#define All(v) (v).begin(), (v).end()
#define pb push_back
#define MP(a, b) make_pair((a), (b))
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const int MOD = 1e9 + 7;

int main() {
    int N;
    cin >> N;
    vector<ll> X(N), Y(N);
    rep(i, N) cin >> X[i] >> Y[i];
    int res = 0;
    rep(i, N) rep(j, N) {
        if(i == j)
            continue;
        ll x1 = X[i], x2 = X[j], y1 = Y[i], y2 = Y[j];
        int cnt = 0;
        rep(k, N) {
            if((x2 - x1) * (Y[k] - y1) == (y2 - y1) * (X[k] - x1))
                cnt++;
        }
        res = max(res, cnt);
    }
    cout << res << endl;
    return 0;
}