#include<bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define gcd __gcd
//#define int LL
//#define pow quickPow
#pragma GCC optimize(2)
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
bool cmp(int a, int b){return a > b;}
int lcm(int a, int b){return a / gcd(a, b) * b;}


const int mod = 998244353;
const int MOD = 1e9 + 7;
const int inf = 2147483647;
const int N = 2e5 + 10, M = 30;

int quickPow(int a,int b){
    int ans=1;
    while(b){
        if(b&1)
            ans=(ans*a)%mod;
        b>>=1;
        a=(a*a)%mod;
    }
    return ans;
}

/*void init(){
    //求阶乘
    fac[0]=1;
    for(int i=1;i<maxn;i++){
        fac[i]=fac[i-1]*i%mod;
    }
    //求逆元
    inv[maxn-1]=quickPow(fac[maxn-1],mod-2);
    for(int i=maxn-2;i>=0;i--){
        inv[i]=inv[i+1]*(i+1)%mod;
    }
}
int C(int n,int m){
    if(m>n){
        return 0;
    }
    if(m==0)
        return 1;
    return fac[n]*inv[m]%mod*inv[n-m]%mod;
}*/

/*int find(int x)
{
    if(fa[x]!=x) fa[x]=find(fa[x]);
    return fa[x];
}*/


void solve()
{
	pii a[N];
	int n;
	cin >> n ;
	for(int i = 1; i <= n; ++ i)
		cin >> a[i].ff >> a[i].ss;
	sort(a + 1, a + n + 1);
	vector<vector<int>> seek(n + 5);
	for(int i = 1; i <= n; ++ i)
	{
		int x = a[i].ff, y = a[i].ss;
		seek[x].pb(y);
	}
	for(int i = 1; i <= n; ++ i)
	{
		vector<int> now = seek[i];
		//sort(now.begin(), now.end());
		/*if(now.empty())
		{
			cout << 0 << endl;
			return;
		}*/ 
		for(int j = 0; j + 1< now.size(); ++ j)//
		{
			if(now[j] == now[j + 1])
			{
				cout << 0 << endl;
				return;
			}
			seek[now[j] + 1].pb(now[j + 1]);
		}
	}
	cout << 1 << endl;
}

signed main()
{
	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	int t = 1;
	cin >> t;
	while(t --)
	{
		solve();
	}
	return 0;
}