#include <bits/stdc++.h>
using namespace std;
#define int long long 
#define pii pair<int,int>
#define INF 0x3f3f3f3f3f3f3f3f
#define all (_a) _a.begin(),_a.end()
struct DSU {
    std::vector<int> f, siz;
     
    DSU() {}
    DSU(int n) {
        init(n);
    }
     
    void init(int n) {
        f.resize(n+2);
        for(int i=1;i<=n+1;i++) f[i]=i;
        siz.assign(n, 1);
    }
     
    int find(int x) {
        while (x != f[x]) {
            x = f[x] = f[f[x]];
        }
        return x;
    }
     
    bool same(int x, int y) {
        return find(x) == find(y);
    }
     
    bool merge(int x, int y) {
        x = find(x);
        y = find(y);
        if (x == y) {
            return false;
        }
        siz[x] += siz[y];
        f[y] = x;
        return true;
    }
     
    int size(int x) {
        return siz[find(x)];
    }
};
void solve(){
    int n;
    cin>>n;
    DSU dt(n);
    vector<int> l(n+1),r(n+1);
    int ans=1;
    for(int i=1;i<=n;i++){
          cin>>l[i]>>r[i];
          int L=dt.find(l[i]);
          int R=dt.find(r[i]+1);
          if(L!=R) dt.merge(L,R);
          else ans=0;
    }
    cout<<ans<<endl;
    
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr),cout.tie(nullptr);
    int T;
    T=1;
    cin>>T;
    while(T--) solve();
    return 0;
}