#include <bits/stdc++.h>
using namespace std;
using ui = unsigned int;
using ull = unsigned long long;
using ll = long long;
#define endl '\n'
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int maxn = 2e5 + 10;
const int mod = 1000000007;
#define inl inline
#define fr(i, a, b) for (int i = a; i <= b; i++)
#define ford(i, a, b) for (int i = a; i >= b; i--)
#define forall(i, a) for (auto &i : a)

/**
   ____         ___ _____
  / ___| _   _ / _ \___ /
  \___ \| | | | | | ||_ \
   ___) | |_| | |_| |__) |
  |____/ \__, |\___/____/
         |___/
*/
istream &operator>>(istream &in, vector<int> &v)
{
    for (auto &i : v)
        in >> i;
    return in;
}
ostream &operator<<(ostream &out, vector<int> &v)
{
    for (auto &i : v)
        out << i << " ";
    return out;
}
bool _output = 0;

#define int ll
struct P
{
    int x, y;
    P(int x, int y) : x(x), y(y) {}
    P operator-(P b) { return P(x - b.x, y - b.y); }
};
int det(P a, P b)
{
    return a.x * b.y - a.y * b.x;
}

void solve(int n)
{
    vector<P> ps;
    for (int i = 0; i < n; i++)
    {
        int x, y;
        cin >> x >> y;
        ps.push_back(P(x, y));
    }
    auto rand = [&]()
    {
        mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
        return rng() % n;
    };
    int cnt = 200;
    int ans = n;
    while (cnt--)
    {
        int x = rand(), y = rand();
        if (x == y)
        {
            // cnt++;
            continue;
        }
        int t = 2;
        for (int i = 0; i < n; i++)
        {
            if (i == x || i == y)
                continue;
            auto ta = ps[x], tb = ps[y], tc = ps[i];
            if (det(tb - ta, tc - ta) == 0)
            {
                t++;
            }
        }
        ans = max(0ll, 3 * t - n * 2);
    }
    cout << ans << endl;
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int _ = 1;
    if (_output)
        cin >> _;
    int n;
    while (cin >> n)
        solve(n);
    return 0;
}