#include <bits/stdc++.h>
#define int long long
const int N=1e6+10;
using namespace std;
int yuan[N];
int n,m,k;
pair<int,int> arr[N];

void solve ()
{
	cin>>n;
	for (int i=1;i<=n;i++)
	{
		cin>>arr[i].first>>arr[i].second;
	}
	sort(arr+1,arr+n+1);

	arr[n+1].first=1; arr[n+1].second=n+1;
	queue<int>q;
	
	int j=1;
	for(int i=1;i<=n;i++)
	{
		while (arr[j].second<i||arr[j].first>i)j++;
		if(arr[j].first<=i&&arr[j].second>=i)
			yuan[i]=j;
	}
	int ans=0;
	for (int i=1;i<=n;i++)
	{
		if(arr[i].first<=i&&arr[i].second>=i)
		{
			if(i==1){
				q.push(i);
			}
			else
			{
				int flg=q.size()%2;
				if(i-yuan[i]>=0&&(i-yuan[i])%2==0)
				{
					while (q.size())q.pop();
				}
				if(flg)
				q.push(i);
				while (q.size()&&q.front()<arr[i].first)q.pop();
			}
			
		}
		else 
		{
			cout<<0<<"\n";
			return ;
		}	
	}
	cout<<q.size()%2<<"\n";
}


signed main ()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	int T;
	cin>>T;
	while (T--)
	{
		solve(); 
	}
}