#include <bits/stdc++.h>

void charming() {
	int n; std::cin >> n;
	std::vector seg(n, std::vector<int> ());
	for (int i = 0, l, r; i < n; ++i) {
		std::cin >> l >> r, --l, --r;
		seg[l].emplace_back(r);
	}
	bool chk = true;
	for (int i = 0; i < n; ++i) {
		if (seg[i].empty()) {chk = false; break;}
		sort(seg[i].begin(), seg[i].end(), [](int x, int y) {return x > y;});
		int cnt = seg[i].size();
		for (int j = 0; j < cnt - 1; ++j) {
			seg[seg[i][j + 1] + 1].emplace_back(seg[i][j]);
		}
	}
	if (chk) std::cout << 1 << '\n';
	else std::cout << 0 << '\n';
}

signed main() {
	std::ios_base::sync_with_stdio(false);
	std::cin.tie(NULL);
	std::cout.tie(NULL);
	int t; std::cin >> t;
	while (t--) charming();
	return 0;
}