#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")

#include <bits/stdc++.h>
#define min(a,b) (a > b ? b : a)
#define max(a,b) (a < b ? b : a)

#define YES (cout << "YES" << endl)
#define NO (cout << "NO" << endl)
#define all(x) (x).begin(), (x).end()
#define endl '\n'
#define mem(a,b) memset(a,b,sizeof(a))
#define rrep(a, b, c) for (a = b; a >= c; a--)
#define rep(a, b, c) for (a = b; a <= c; a++)
#define lowbit(a) (a & (-a))
#define int long long
#define IOS ios::sync_with_stdio(0); cout.tie(0);

using namespace std;

typedef double db;
typedef pair<int,int> pii;
typedef array <int,3> a3;

const db eps = 1e-7;
const int inf = 0x3f3f3f3f3f3f3f3f;
const int N = 1e6 + 10;

int n;
int p[N];

int find(int x){
    if (p[x] != x) p[x] = find(p[x]);
    return p[x];
}

void merge(int a,int b){
    a = find(a);
    b = find(b);

    if (a != b){
        p[a] = b;
    }
}

void solve(){
    cin >> n;

    int i;
    rep(i,1,n + 1){
        p[i] = i;
    }

    rep(i,1,n){
        int x,y;
        cin >> x >> y;

        merge(x, y + 1);
    }
    
    int pos = find(1);
    rep(i,1,n){
        if (find(i) != find(pos)){
            cout << 0 << endl;
            return;
        }
    }

    cout << 1 << endl;
}   

signed main(){
	IOS;
    cin.tie(0);

    int T = 1;
    cin >> T;

    while (T --){
        solve();
    }

    // system("pause");
}