#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,n,a) for(int i=n;i>=a;i--)
#define PII pair<int,int>
#define lowbit(x) x&(-x)
#define int long long
#define endl "\n"
using namespace std;
const int inf=1e10;
const int MOD=998244353;
const int N=2e3+5;
void solve()
{
	int n;
	cin>>n;
	vector<int> mp[n+2];
	for(int i=1;i<=n;i++)
	{
		int l,r;
		cin>>l>>r;
		mp[l].push_back(r+1);//要判断是否是一棵树，如果是就是1，否则是0
		mp[r+1].push_back(l);
	}
	vector<int> vis(n+1,0);
	int ans=1;
	vis[1]=1;
	function<void(int)> dfs=[&](int u)->void
	{
		for(auto v:mp[u])
		{
			if(!vis[v])
			{
				vis[v]=1;
				dfs(v);
				ans++;
			}
		}
	};
	dfs(1);
//	cout<<ans<<endl;
	if(ans==n)
	{
		cout<<1<<endl;
	}
	else cout<<0<<endl;
}
signed main()
{
	//注意爆long long还是限制long long
	//看下单测多测？多测注意清空全局数组
	
	ios::sync_with_stdio(false);//快读注释这一段
	cin.tie(0);
	cout.tie(0);
	
	int _=1;
	cin>>_;
	for(int i=1;i<=_;i++)
	{
		solve();
	}
	return 0;
}