/*
    Author:zeke

    pass System Test!
    GET AC!!
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
using ld = long double;
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define rep3(var, min, max) for (ll(var) = (min); (var) < (max); ++(var))
#define repi3(var, min, max) for (ll(var) = (max)-1; (var) + 1 > (min); --(var))
#define Mp(a, b) make_pair((a), (b))
#define F first
#define S second
#define Icin(s) \
    ll(s);      \
    cin >> (s);
#define Scin(s) \
    ll(s);      \
    cin >> (s);
template <class T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T& a, const T& b) {
    if (b < a) {
        a = b;
        return 1;
    }
    return 0;
}
typedef pair<ld, ld> P;
typedef vector<ll> V;
typedef vector<V> VV;
typedef vector<P> VP;
ll mod = 1e9 + 7;
ll MOD = 1e9 + 7;
ll INF = 1e18;
// cout << "Case #" << index << " :IMPOSSIBLE";
int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    ll n;
    cin>>n;
    VP vec(n);
    rep(i,n)cin>>vec[i].F>>vec[i].S;
    ll res=0;
    rep(i,n){
        rep3(j,i+1,n){
            ld dy=vec[j].S-vec[i].S;
            ld dx=vec[j].F-vec[i].F;
            ld tang;
            if(dx==0){
                tang=1e9;
            }else{
                tang=dy/dx;
            }
            ll temp=0;
            rep(k,n){
                if(k==i||k==j){
                    temp++;
                    continue;
                }
                ld tempy=vec[k].S-vec[i].S;
                ld tempx=vec[k].F-vec[i].F;
                ld temptan;
                if(tempx==0){
                    temptan=1e9;
                }else{
                    temptan=tempy/tempx;
                }
                if(temptan==tang){
                    temp++;
                }
            }
            chmax(res,temp);
        }
    }
    cout<<res<<endl;
}