#include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <vector>
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;

int main()
{
    int n;
    cin >> n;
    vector<pair<double, double>> x(n);
    int ans = 2;
    rep(i, 0, n) cin >> x[i].first >> x[i].second;
    rep(i, 0, n-1) rep(j, i+1, n){
        double a, b;
        int count = 0;
        a = (x[i].second - x[j].second)/(x[i].first - x[j].first);
        b = (x[i].first*x[j].second - x[i].second*x[j].first)/(x[i].first - x[j].first);
        rep(k, 0, n){
            if(x[i].first == x[j].first){
                if(x[k].first == x[i].first) count++;
            }
            else if(x[k].second == a*x[k].first + b) count++;
        }
        ans = max(ans, count);
    }
    cout << ans << endl;
    return 0;
}