//
// Created by 24087 on 9/15/2024.
//
#include <algorithm>
#include <iostream>
#include <vector>

class Solution {
    struct range {
        int l, r, idx;
        range(const int _l, const int _r, const int _i)
            : l(_l), r(_r), idx(_i) {}
        friend bool operator<(const range &a, const range &b) {
            return a.r - a.l < b.r - b.l;
        }
    };

    int n = 0, ans = 0;
    std::vector<bool> vis;
    std::vector<range> limit;

    void dfs(int depth) {
        if (depth == n) {
            ans ^= 1;
            return;
        }
        for (int i = limit[depth].l; i <= limit[depth].r; i++) {
            if (vis[i]) {
                continue;
            }
            vis[i] = true;
            dfs(depth + 1);
            vis[i] = false;
        }
    }

   public:
    Solution() {
        std::cin >> n;
        vis.resize(n + 1);
        limit.reserve(n + 1);
        for (int i = 1; i <= n; i++) {
            int x, y;
            std::cin >> x >> y;
            limit.emplace_back(x, y, i);
        }
        std::sort(limit.begin(), limit.end());
        dfs(0);
        std::cout << ans << '\n';
    }
};

signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);

    int t;
    std::cin >> t;
    while (t--) {
        Solution ans;
    }
}