#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
using namespace std;
using ll = long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1e9;
const ll MOD = 1e9 + 7;


int main(){
    int n;
    cin >> n;

    vector<int> x(n), y(n);
    rep(i, n) cin >> x[i] >> y[i];

    int ans = 2;
    rep(i, n){
        for(int j=i+1; j<n; j++){
            int sum = 0;
            rep(k, n){
                sum += ((x[i]-x[j])*(y[i]-y[k]) == (x[i]-x[k])*(y[i]-y[j]));
            }
            chmax(ans, sum);
        }
    }

    cout << ans << endl;
}