#include <bits/stdc++.h>

using namespace std;

#define endl '\n'
#define int long long
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define rep(i, a, n) for (int i = a; i <= n; i++)
#define per(i, a, n) for (int i = n; i >= a; i--)
#define all(x) (x).begin(), (x).end()
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;

void solve()
{
	int n;
	cin >> n;
	vector<vector<int>> a(n + 1);
	vector<int> vis(n + 2, 0);
	rep (i, 1, n)
	{
		int l, r;
		cin >> l >> r;
		a[l].push_back(r);
	}
	rep (i, 1, n)
	{
		sort(all(a[i]));
	}
	rep (i, 1, n)
	{
		int last = i - 1;
		for (auto x: a[i])
		{
			vis[last + 1]++;
			last = x;
		}
	}
	rep (i, 1, n) if (vis[i] % 2 == 0)
		{
			cout << 0 << endl;
			return;
		}
	cout << 1 << endl;
}

signed main()
{
	IOS;
	int t = 1;
	cin >> t;
	while (t--) solve();
	return 0;
}