/* name: std
 * author: 5ab
 * created at: 2023-11-24
 */
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;

#define all(x) (x).begin(), (x).end()
#define ssz(x) (int((x).size()))

auto chmax = [](auto& x, auto y) { if (x < y) x = y; };
auto chmin = [](auto& x, auto y) { if (y < x) x = y; };

using ll = long long;
using ld = long double;
const int max_n = 3000;

struct point
{
	int x, y;
	point operator-(const point& rhs) const {
		return { x - rhs.x, y - rhs.y };
	}
	bool operator<(const point& rhs) const {
		return x == rhs.x ? y < rhs.y : x < rhs.x;
	}
	bool operator==(const point& rhs) const = default;
}
a[max_n];

ll dot(const point& x, const point& y) {
	return 1ll * x.x * y.x + 1ll * x.y * y.y;
}
ll cross(const point& x, const point& y) {
	return 1ll * x.x * y.y - 1ll * x.y * y.x;
}

signed main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int cas, n;
	
	cin >> cas;
	while (cas--)
	{
		cin >> n;
		for (int i = 0; i < n; i++)
			cin >> a[i].x >> a[i].y;
		
		swap(a[0], *min_element(a, a + n));
		sort(a + 1, a + n, [&](const auto& p, const auto& q) {
			ll x = cross(p - a[0], q - a[0]);
			return x != 0 ? x > 0 : dot(p - a[0], q - p) > 0;
			// return x > 0;
		});
		if (n <= 2 || cross(a[1] - a[0], a[n - 1] - a[0]) == 0)
		{
			cout << (n == 1 ? 1 : 2) << "\n";
			continue;
		}
		
		vector<point> cv, res;
		for (int i = 0; i < n; i++)
		{
			while (ssz(cv) > 1 && cross(a[i] - cv.back(), cv.back() - cv.end()[-2]) > 0)
				cv.pop_back();
			cv.push_back(a[i]);
		}
		for (int i = n - 2; cross(a[n - 1] - a[i], a[i] - a[0]) == 0; i--)
			cv.push_back(a[i]);
		
		sort(a, a + n), sort(all(cv));
		for (int i = 0, j = 0; i < n; i++)
		{
			if (j < ssz(cv) && a[i] == cv[j])
				j++;
			else
				res.push_back(a[i]);
		}
		
		int ans = 0;
		
		vector<pair<int, ld>> cd;
		cd.reserve(ssz(res));
		
		for (int i = 0; i < n; i++)
		{
			cd.clear();
			for (int j = 0; j < ssz(res); j++) if (res[j] != a[i])
			{
				auto d = res[j] - a[i];
				cd.emplace_back(d.x > 0 || (d.x == 0 && d.y > 0), d.y / ld(d.x));
			}
			sort(all(cd));
			ans += unique(all(cd)) - cd.begin();
		}
		
		cout << ans + ssz(cv) << "\n";
	}
	
	return 0;
}
// started coding at: 11-24 09:44:44