#include "bits/stdc++.h"
using namespace std;

const int N = 2E5 + 50;
int n;
using db = long long;
using ll = long long;
struct Point
{
    db x, y;
    Point() = default;
    Point(db x, db y) : x(x), y(y) {}
    db operator^(const Point &t) const
    {
        return x * t.y - y * t.x;
    }
    Point operator-(const Point &t) const
    {
        return Point(x - t.x, y - t.y);
    }
} p[N];

int rd(int l, int r)
{
    return 1ll * rand() % r * rand() % r + 1;
}

int main()
{
    srand(time(NULL));
    while (scanf("%d", &n) == 1)
    {
        for (int i = 1; i <= n; i++)
        {
            int x, y;
            scanf("%d%d", &x, &y);
            p[i].x = x, p[i].y = y;
        }
        ll ans = 0, tmp;
        for (int cnt = 0; cnt < 30; ++cnt)
        {
            int x = rd(1, n), y = rd(1, n);
            while (x == y)
                y = rd(1, n);
            long long sum = 0;
            for (int i = 1; i <= n; ++i)
                sum += ((p[x] - p[i]) ^ (p[y] - p[i])) == 0;
            if (sum * 3 >= 2 * n)
            {
                ans = max(ans, sum - 2 * (n - sum));
            }
        }
        printf("%lld\n", ans);
    }
    return 0;
}