#include <bits/stdc++.h>
#define init(x) memset (x,0,sizeof (x))
#define ll long long
#define ull unsigned long long
#define INF 0x3f3f3f3f
using namespace std;
const int MAX = 1e6 + 5;
const int MOD = 1e9 + 7;
inline int read ();
struct node
{
	int l,r;
} f[MAX];
int t,n,ok;
map <pair <int,int>,int> mp;
vector <int> head[MAX],tail[MAX];
int main ()
{
	//freopen (".in","r",stdin);
	//freopen (".out","w",stdout);
	t = read ();
	while (t--)
	{
		n = read ();ok = 0;
		mp.clear ();
		for (int i = 1;i <= n;++i) f[i].l = read (),f[i].r = read ();
		for (int i = 1;i <= n;++i)
		{
			head[i].clear ();tail[i].clear ();
			if (mp[{f[i].l,f[i].r}]) {puts ("0");ok = 1;break;};
			mp[{f[i].l,f[i].r}] = 1; 
		}
		if (ok) continue;
		for (int i = 1;i <= n;++i)
		{
			head[f[i].l].push_back (i);
			tail[f[i].r].push_back (i);
		}
		for (int i = 1;i < n;++i)
		{
			if (!head[i + 1].size () || !tail[i].size ()) continue;
			for (auto x : tail[i])
			{
				for (auto y : head[i + 1])
				{
					if (mp[{f[x].l,f[y].r}] && f[y].r - f[x].l > 1) {puts ("0");ok = 1;break;};
					mp[{f[x].l,f[y].r}] = 1;
				}
			}
		}
		if (!ok) puts ("1");
	}
	return 0;
}
inline int read ()
{
    int s = 0;int f = 1;
    char ch = getchar ();
    while ((ch < '0' || ch > '9') && ch != EOF)
	{
        if (ch == '-') f = -1;
        ch = getchar ();
    }
    while (ch >= '0' && ch <= '9')
	{
        s = s * 10 + ch - '0';
        ch = getchar ();
    }
    return s * f;
}