#include<bits/stdc++.h>
#define lc p << 1
#define rc p << 1 | 1
using namespace std;

using ll = long long;
using ull = unsigned long long;

constexpr int N = 1e6 + 10;

ull v[N];
void pre() {
	v[0] = 2187;
	for (int i = 1; i < N; i++) {
		v[i] = v[i - 1] * 3;
	}
}

struct Segment_Tree {
	struct T {
		int l, r;
		ull tag, val;
	};

	int n;
	vector<T> tr;
	void init(int n) {
		this -> n = n;
		tr.resize(n << 2 + 1);
	}

	void pushup(int p) {
		tr[p].val = tr[lc].val + tr[rc].val;
	}

	void pushdown(int p) {
		if (tr[p].tag) {
			tr[lc].val += (tr[lc].r - tr[lc].l + 1) * tr[p].tag;
			tr[rc].val += (tr[rc].r - tr[rc].l + 1) * tr[p].tag;
			tr[lc].tag += tr[p].tag;
			tr[rc].tag += tr[p].tag;
			tr[p].tag = 0;
		}
	}

	void build(int p, int l, int r) {
		tr[p].l = l, tr[p].r = r, tr[p].tag = 0;
		if (l == r) {
			tr[p].val = 0;
			return;
		}
		int mid = (l + r) >> 1;
		build(lc, l, mid);
		build(rc, mid + 1, r);
		pushup(p);
	}

	void update(int p, int l, int r, int L, int R, ull k) {
		if (tr[p].l >= L && tr[p].r <= R) {
			tr[p].val += (tr[p].r - tr[p].l + 1) * k;
			tr[p].tag += k;
			return;
		}
		pushdown(p);
		int mid = (l + r) >> 1;
		if (L <= mid) {
			update(lc, l, mid, L, R, k);
		}
		if (R > mid) {
			update(rc, mid + 1, r, L, R, k);
		}
		pushup(p);
	}

	ull query(int p, int l, int r, int L, int R) {
		if (tr[p].l >= L && tr[p].r <= R) {
			return tr[p].val;
		}
		pushdown(p);
		int mid = (l + r) >> 1;
		ull res = 0;
		if (L <= mid) {
			res += query(lc, l, mid, L, R);
		}
		if (R > mid) {
			res += query(rc, mid + 1, r, L, R);
		}
		return res;
	}
};

void solve() {
	int n;
	cin >> n;

	Segment_Tree sg;
	sg.init(n);
	sg.build(1, 1, n);

	for (int i = 1; i <= n; i++) {
		int l, r;
		cin >> l >> r;
		sg.update(1, 1, n, l, r, v[i]);
	}

	map<ull, int> cnt;
	for (int i = 1; i <= n; i++) {
		ull v = sg.query(1, 1, n, i, i);
		cnt[v]++;
		//cerr << v << '\n';
		if (cnt[v] >= 2) {
			cout << "0" << '\n';
			return;
		}
	}
	cout << "1" << '\n';
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	pre();
	int T;
	cin >> T;
	while(T--) {
		solve();
	}
	return 0;
}