#include <bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<vector>
#include<map>
#include<set>
#include<array>
using namespace std;
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
typedef long long ll;
typedef double db;
typedef pair<int,int> P;
#define fi first
#define se second
#define pb push_back
#define dbg(x) cerr<<(#x)<<":"<<x<<" ";
#define dbg2(x) cerr<<(#x)<<":"<<x<<endl;
#define SZ(a) (int)(a.size())
#define sci(a) scanf("%d",&(a))
#define pt(a) printf("%d",a);
#define pte(a) printf("%d\n",a)
#define ptlle(a) printf("%lld\n",a)
#define debug(...) fprintf(stderr, __VA_ARGS__)
using namespace std;
const int N=2e3+10;
int t,n,u,v,par[N],sz[N],sum[N];
map<P,int>mp;
int find(int x){
    return par[x]==x?x:par[x]=find(par[x]);
}
void mer(int u,int v){
    u=find(u),v=find(v);
    if(u==v)return;
    par[v]=u;
    sz[u]+=sz[v];
}
int main(){
    sci(t);
    while(t--){
        sci(n);
        rep(i,1,n)par[i]=i,sz[i]=1,sum[i]=0;
        mp.clear();
        bool ok=1;
        rep(i,1,n){
            sci(u),sci(v);
            mp[P(u,v)]++;
            if(mp[P(u,v)]>=2)ok=0;
            sum[u]++;
            sum[v+1]--;
            mer(u,v);
        }
        rep(i,1,n){
            sum[i]+=sum[i-1];
            if(!sum[i]){
                ok=0;
                break;
            }
        }
        if(!ok){
            puts("0");
            continue;
        }
        int ans=1;
        rep(i,1,n){
            int f=find(i);
            if(f==i)ans*=sz[i];
            ans%=2;
        }
        pte(ans);
    }
    return 0;
}