#include <bits/stdc++.h>

using namespace std;

using i64 = long long;
using i128 = __int128;
using ull = unsigned long long;
#define pll pair<ll, ll>
#define pii pair<int, int>
#define vi vector<int>
#define fir(i, a, b) for (int i = a; i <= b; i++)
#define pqi priority_queue<int> // 优先队列

#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define int long long

const int N = 1e6 + 10;
vector<int> f(N);

int find(int x)
{
    return f[x] == x ? x : f[x] = find(f[x]);
}
void solve()
{
    int n;
    cin >> n;
    for (int i = 0; i < n + 1; i++)
        f[i] = i;

    bool st = 1;
    for (int i = 1; i < n + 1; i++)
    {
        int l, r;
        cin >> l >> r;
        if (find(l) == find(r))
            st = 0;
        else
            f[find(l)] = find(r);
    }

    cout << st << "\n";
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t;
    cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}