#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

#define el '\n'
#define FIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef complex<ld> pt;
typedef unsigned long long ull;

template<typename T, typename X>
using hashTable = gp_hash_table<T, X>;
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

// mt19937_64 for long long
mt19937 rng(std::chrono::system_clock::now().time_since_epoch().count());

void doWork()
{
    int n;
    cin >> n;
    vector <pair<ll, ll>> v(n + 1);
    for(int i = 1; i <= n; i++)
        cin >> v[i].first >> v[i].second;

    int ans = 0;
    for(int i = 1; i <= n; i++)
    {
        for(int j = i + 1; j <= n; j++)
        {
            int anyT = 0;
            map<pair<ll, ll>, int> mp;

            ll y1 = j - i;
            ll x1 = v[j].first - v[i].first;
            ll v1 = v[j].second - v[i].second;
            for(int k = j + 1; k <= n; k++)
            {
                ll y2 = k - i;
                ll x2 = v[k].first - v[i].first;
                ll v2 = v[k].second - v[i].second;
                ll A = x1 * y2, B = x2 * y1, C = v2 * y1, D = v1 * y2;

                // ax * by - ay * bx == 0
                // (x1 + t * v1) * y2 - (x2 + t * v2) * y1 == 0
                // x1y2 + tv1y2 - x2y1 - tv2y1 = 0
                // x1y2 - x2y1 = tv2y1 - tv1y2
                // x1y2 - x2y1 = t(v2y1 - v1y2)
                // A - B = t*(C - D)
                // t = (A - B) / (C - D)

                if(C == D && A == B) // any T will work when A == B
                {
                    anyT++;
                    continue;
                }
                else if(C == D) // !0 == 0
                    continue;

                ll a = A - B, b = C - D, g = __gcd(a, b);
                a /= g, b /= g;
                if(b < 0)
                    a *= -1;
                if(a >= 0)
                    mp[{a, b}]++;
            }
            ans = max(ans, anyT); // 2 is i and j
            for(auto &it: mp)
                ans = max(ans, it.second + anyT);
        }
    }
    cout << ans + 2;
}

signed main()
{
    FIO
    int T = 1;
//    cin >> T;
    for(int i = 1; i <= T; i++)
        doWork();
}