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

const int INF = 1e9;
const int N = 1000006, NN = N * 4;
int T, n;

struct segt
{
	int mn[NN], to[NN];
	ll lz[NN];
	void build(int now, int l, int r)
	{
		mn[now] = lz[now] = 0;
		to[now] = l;
		if (l == r) return;
		int mid = (l + r) >> 1;
		build(now << 1, l, mid);
		build(now << 1 | 1, mid + 1, r);
	}
	void up(int now)
	{
		if (mn[now << 1] < mn[now << 1 | 1])
			to[now] = to[now << 1];
		else
			to[now] = to[now << 1 | 1];
		mn[now] = min(mn[now << 1], mn[now << 1 | 1]);
	}
	void upd(int now, ll v)
	{
		lz[now] += v;
		mn[now] += v;
	}
	void down(int now)
	{
		upd(now << 1, lz[now]);
		upd(now << 1 | 1, lz[now]);
		lz[now] = 0;
	}
	void ad1(int now, int l, int r, int ql, int qr, ll v)
	{
		if (ql <= l && qr >= r)
		{
			upd(now, v);
			return;
		}
		if (ql > r || qr < l) return;
		down(now);
		int mid = (l + r) >> 1;
		ad1(now << 1, l, mid, ql, qr, v);
		ad1(now << 1 | 1, mid + 1, r, ql, qr, v);
		up(now);
	}
	void ad2(int now, int l, int r, int p)
	{
		if (l == r)
		{
			lz[now] = mn[now] = INF;
			return;
		}
		int mid = (l + r) >> 1;
		down(now);
		if (p <= mid) ad2(now << 1, l, mid, p);
		else ad2(now << 1 | 1, mid + 1, r, p);
		up(now);
	}
	int get(int now, int l, int r, int p)
	{
		if (l == r) return lz[now];
		int mid = (l + r) >> 1;
		down(now);
		if (p <= mid) return get(now << 1, l, mid, p);
		else return get(now << 1 | 1, mid + 1, r, p);
	}
} t1, t2;
int l[N], r[N];

int main()
{
	scanf("%d", &T);
	while (T--)
	{
		scanf("%d", &n);
		t1.build(1, 1, n);
		t2.build(1, 1, n);
		int cnt = 0;
		for (int i = 1; i <= n; i++)
		{
			scanf("%d%d", &l[i], &r[i]);
			if (l[i] == 1)
			{
				t2.ad2(1, 1, n, r[i]);
				cnt++;
			}
			if (l[i] - 1) t1.ad1(1, 1, n, l[i] - 1, l[i] - 1, i);
			t1.ad1(1, 1, n, r[i], r[i], i);
			if (l[i] - 1) t2.ad1(1, 1, n, l[i] - 1, l[i] - 1, 1);
			t2.ad1(1, 1, n, r[i], r[i], 1);
		}
		bool ok = true;
		for (int i = cnt + 1; i <= n; i++)
		{
			if (t2.mn[1] != 1)
			{
				//printf("%d %d\n", cnt, i);
				ok = false;
				break;
			}
			int t = t1.get(1, 1, n, t2.to[1]), tt = t2.to[1];
			t1.ad1(1, 1, n, l[t] - 1, l[t] - 1, -t);
			t1.ad1(1, 1, n, r[t], r[t], -t);
			t2.ad1(1, 1, n, l[t] - 1, l[t] - 1, -1);
			t2.ad1(1, 1, n, r[t], r[t], -1);
			t2.ad2(1, 1, n, tt);
		}
		if (ok) printf("1\n");
		else printf("0\n");
	}
	return 0;
}