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

using ll = long long;
using ld = long double;

#define all(a) begin(a), end(a)
#define len(a) int((a).size())

struct point {
    ll x, y;

    ll length() const {
        return x * x + y * y;
    }

    point operator-(const point &other) const {
        return {x - other.x, y - other.y};
    }

    ll operator%(const point &other) const {
        return x * other.y - y * other.x;
    }

    int side() const {
        return make_pair(x, y) < make_pair(0ll, 0ll);
    }
};

void solve(int /* test_num */) {
    int n;
    cin >> n;
    vector<point> a(n);
    for (auto &[x, y] : a) {
        cin >> x >> y;
    }
    if (n <= 2) {
        cout << n << '\n';
        return;
    }

    bool on_line = true;
    for (int i = 2; i < n; i++) {
        on_line &= (a[i] - a[0]) % (a[1] - a[0]) == 0;
    }
    if (on_line) {
        cout << "2\n";
        return;
    }

    for (int i = 1; i < n; i++) {
        if (make_pair(a[i].x, a[i].y) < make_pair(a[0].x, a[0].y)) {
            swap(a[i], a[0]);
        }
    }

    sort(1 + all(a), [&](point p, point q) {
        p = p - a[0];
        q = q - a[0];
        ll prod = p % q;
        if (prod != 0) {
            return prod > 0;
        }
        return p.length() < q.length();
    });

    vector<point> hull = {a[0], a[1]}, rem;
    for (int i = 2; i < n; i++) {
        while ((hull.back() - hull[len(hull) - 2]) % (a[i] - hull.back()) < 0) {
            rem.push_back(hull.back());
            hull.pop_back();
        }
        hull.push_back(a[i]);
    }

    int ans = len(hull);
    for (auto c : a) {
        vector<point> v;
        for (auto p : rem) {
            if (p.x != c.x || p.y != c.y) {
                v.push_back(p - c);
            }
        }
        if (v.empty()) {
            continue;
        }

        auto compare = [&](point p, point q) {
            if (p.side() != q.side()) {
                return p.side() < q.side();
            }
            return p % q < 0;
        };

        sort(all(v), compare);
        int tot = 1;
        ans++;
        for (int i = 0; i + 1 < len(v); i++) {
            if (compare(v[i], v[i + 1])) {
                tot++;
                ans++;
            }
        }
    }
    cout << ans << '\n';
}

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    int tests;
    cin >> tests;
    for (int test_num = 1; test_num <= tests; test_num++) {
        solve(test_num);
    }
}