///Enta etfsh5t nseet el rank

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update

using namespace std;
using namespace __gnu_pbds;

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,
        tree_order_statistics_node_update>;
#define pb push_back
#define F first
#define S second
#define f(i, a, b) for (int i = a; i < b; i++)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define sz(x) (int)(x).size()
//#define mp(x, y) make_pair(x, y)
#define popCnt(x) (__builtin_popcountll(x))
#define int ll

using ll = long long;
using ull = unsigned long long;
using uint = uint32_t;
using ii = pair<int, int>;

const int N = 3e6 + 6, A = 26, LG = 18, MOD = (119 << 23) + 1;
const long double PI = acos(-1);
const long double EPS = 1e-9;
const ll INF = 1e15;
int n, m;
int s[305], v[305], cnt[305][305];
map<ii, int> mp[305][305];

void doWork() {
    cin >> n;
    f(i, 1, n + 1) cin >> s[i] >> v[i];
    f(i, 1, n + 1)f(j, i + 1, n + 1)f(k, j + 1, n + 1) {
                int x1 = (s[j] - s[i]) * (k - j) - (s[k] - s[j]) * (j - i);
                int x2 = (v[k] - v[j]) * (j - i) - (v[j] - v[i]) * (k - j);
                if (x2 == 0 && x1 != 0)continue;
                if (x1 == 0 && x2 == 0)cnt[i][j] += 1;
                else {
                    int g = __gcd(x1, x2);
                    x1 /= g;
                    x2 /= g;
                    if (x2 < 0) {
                        x2 *= 1;
                        x1 *= -1;
                    }
                    if (x1 >= 0)
                        mp[i][j][{x1, x2}] += 1;
                }
            }
    int ans = 0;
    f(i, 1, n + 1)
        f(j, i + 1, n + 1) {
            int mx = 0;
            for (auto it: mp[i][j])mx = max(mx, it.S);
            ans = max(ans, mx + cnt[i][j]);
        }
    cout << ans + 2 << '\n';
}


int32_t main() {
#ifdef ONLINE_JUDGE
    ios_base::sync_with_stdio(0);
    cin.tie(0);
#endif // ONLINE_JUDGE
    int t = 1;
//    cin >> t;
    while (t--)
        doWork();

    return 0;
}