#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
using lll = __int128;
using ld = long double;

const int N = 1e6 + 5, M = 1e9 + 7;


template<typename T>
struct Fen{
    int n;
    vector<T>a;
    Fen(int n_ = 0) {
        init(n_);
    }
    void init(int n_) {
        n = n_;
        a.assign(n + 1, T{});
    }
    void add(int x, const T& v) {
        for (int i = x;i <= n;i += i & -i) {
            a[i] += v;
        }
    }
    T qry(int x) {
        T ans{};
        for (int i = x;i > 0;i -= i & -i) {
            ans += a[i];
        }
        return ans;
    }
    T qry(int l, int r) {
        return qry(r) - qry(l - 1);
    }
    int kth(const T& k) {
        int x = 0;
        T cur{};
        for (int i = 1 << __lg(n);i > 0;i /= 2) {
            if (x + i <= n && cur + a[i + x] < k) {
                x += i;
                cur += a[x];
            }
        }
        return x + 1;
    }
};

using ull = unsigned long long;

int res;
int a[10], n, L[10], R[10];
void dfs(int i) {
    if (i == n + 1) {
        for (int j = 1;j <= n;j++) {
            if (a[j] > R[j] || a[j] < L[j])return;
        }
        res++;
        return;
    }
    for (int j = 1;j <= n;j++) {
        if (!a[j]) {
            a[j] = i;
            dfs(i + 1);
            a[j] = 0;
        }
    }
}

void solve() {
    cin >> n;
    if (n <= 6) {
        for (int i = 1;i <= n;i++) {
            cin >> L[i] >> R[i];
        }
        res = 0;
        dfs(1);
        cout << res % 2 << endl;
        return;
    }
    set<pair<int, int>>st;
    Fen<ull>t(n + 1);
    bool ok = 1;
    ull s = 0, p = 1;
    for (int i = 1;i <= n;i++) {
        int l, r;
        cin >> l >> r;
        if (st.count({ l,r }))ok = 0;
        st.insert({ l,r });
        p *= 13;
        t.add(l, p);
        t.add(r + 1, -p);
    }
    set<ull>stt;
    for (int i = 1;i <= n;i++) {
        s += t.qry(i);
        if (stt.count(s))ok = 0;
        stt.insert(s);
    }
    cout << !ok << endl;
}

signed main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int t = 1;
    // cout << fixed << setprecision(10);
    cin >> t;
    while (t--)solve();
}