#include<bits/stdc++.h>
using namespace std;
#define For(i,a,b) for(int i=a;i<=b;i++)
#define int long long
const int N=1e6+10;


void solve()
{
    int i,j,n;
    cin>>n;
    priority_queue<int,vector<int>,greater<int>> F[n+2];

    int l,r;
    For(i,1,n)
    {
        cin>>l>>r;
        F[l].push(r);
    }

    for(i=1;i<=n;i++)
    {
        if(F[i].empty())
        {
            cout<<"0\n";
            return ;
        }
        int t=F[i].top();
        F[i].pop();
        if(!F[i].empty()&&F[i].top()==t)
        {
            cout<<"0\n";
            return ;
        }

        if(F[i].size()>F[t+1].size())
        {
            F[i].swap(F[t+1]);
        }
        while(!F[i].empty())
        {
            F[i+1].push(F[i].top());
            F[i].pop();
        }
    }
    cout<<"1\n";
    return ;
}

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