#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")
typedef long long ll;
#define pll pair<ll,ll>
const int inf=0x3f3f3f3f;
const int N=1e6+5;
const int mod=99844854;
#define PI 3.1415926
#define fi first
#define se second
struct st{
	ll l,r;
}a[N];
inline bool cmp(st s1,st s2){
	if(s1.l!=s2.l)return s1.l<s2.l;
	return s1.r<s2.r;
}
ll n,cnt1,last,num;
inline void solve(){
	cin>>n;
	for(ll i=1;i<=n;++i)cin>>a[i].l>>a[i].r;
	cnt1=10;
	while(cnt1--){
		last=1;num=0;
		sort(a+1,a+1+n,cmp);
		for(ll i=1;i<n;++i){
			if(a[i+1].l==a[last].l){
				if(a[i].r==a[i+1].r){
					cout<<"0\n";
					return;
				}
				else{
					a[i+1].l=a[i].r+1;
					num++;
				}
			}
			else{
				if(num==0&&(a[i+1].l!=(a[last].l+1))){
					cout<<"0\n";
					return;
				}
				last=i+1;
			}
		}
	}
	cout<<"1\n";
	return;
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t;cin>>t;
    while(t--){
    	solve();
	}
    return 0;
}