#include<bits/stdc++.h>
using namespace std;
#define int long long
#define inf 0x3f3f3f3f3f3f3f3f
typedef pair<int,int> PII;
void solve(){
	int n;
	cin>>n;
	priority_queue<PII,vector<PII>,greater<PII>>q;
	for(int i=1,x,y;i<=n;i++){
		cin>>x>>y;
		q.push({x,y});
	}
	vector<PII>ans;
	for(int i=1;i<=n;i++){
		int x,y=-1;
		if(q.size()==0){
			cout<<0<<endl;
			return ;
		}
		while(q.size()&&(y<i)){
			x=q.top().first;
			y=q.top().second;
			q.pop();
			if(x>i){
				cout<<0<<endl;
				return ;
			}
		}
		ans.push_back({i,y});
	}
//	for(auto [x,y]:ans){
//		cout<<x<<" "<<y<<endl;
//	}
	int p=1;
	for(int i=1;i<ans.size();i++){
		auto [x,y]=ans[i-1];
		auto [x2,y2]=ans[i];
		if(x2>y+1||x2<y){
			cout<<0<<endl;
			return ;
		}
		if(!((p>=x&&p<=y)&&(p+1>=x2&&p+1<=y2))){
			cout<<0<<endl;
			return ;
		}
		if(y-x+1>=3||y2-x2+1>=3){
			cout<<0<<endl;
			return ;
		}
		p++;
	}
	cout<<1<<endl;
}
signed main(){
	int t=1;ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	cin>>t;
	while(t--)solve();
	return 0;
}