#include <bits/stdc++.h>

inline int read() {
    int x = 0;
    char ch = getchar();

    while (!isdigit(ch))
        ch = getchar();

    while (isdigit(ch))
        x = x * 10 + ch - '0', ch = getchar();

    return x;
}

#define pii std::pair<int, int>
#define mkp(a, b) std::make_pair(a, b)
const int N = 2000010;
std::vector<pii> vec[N];
pii son[N];
int idx[N], p[N];
int tmp1[N], tmp2[N], tmp3[N], tmp4[N];

inline int solve(int l, int r) {
    // for (int i = l; i <= r; ++i)
    // printf("%d %d\n", idx[i], p[idx[i]]);
    // puts("");
    int flg1 = false, flg2 = false, flg3 = false, flg4 = false;
    int len1 = 0, len2 = 0, len3 = 0, len4 = 0;

    for (int i = l; i <= r; ++i) {
        int ls = vec[idx[i]][p[idx[i]]].first;
        int rs = vec[idx[i]][p[idx[i]]].second;

        if (ls == -1 && rs == -1)
            return true;

        if (ls != -1 && rs == -1) {
            flg1 = true;
            tmp1[++len1] = idx[i];
            p[idx[i]] = ls;
        }

        if (ls == -1 && rs != -1) {
            flg2 = true;
            tmp2[++len2] = idx[i];
            p[idx[i]] = rs;
        }

        if (ls != -1 && rs != -1) {
            flg3 = true;
            int lls = vec[idx[i]][ls].first, lrs = vec[idx[i]][ls].second;
            int rls = vec[idx[i]][rs].first, rrs = vec[idx[i]][rs].second;

            if (lls == -1 && lrs == -1 && rls == -1 && rrs == -1)
                flg4 = true;

            if (lls == -1 && lrs == -1 && !flg4)
                tmp4[++len4] = idx[i], p[idx[i]] = rs;

            if (rls == -1 && rrs == -1 && !flg4)
                tmp3[++len3] = idx[i], p[idx[i]] = ls;
        }
    }

    if (!flg1 || !flg2 || !flg3) {
        // std::cerr << idx[l] << ' ' << idx[r] << std::endl;
        return false;
    }

    int w = l;

    for (int i = 1; i <= len1; ++i)
        idx[w++] = tmp1[i];

    for (int i = 1; i <= len2; ++i)
        idx[w++] = tmp2[i];

    for (int i = 1; i <= len3; ++i)
        idx[w++] = tmp3[i];

    for (int i = 1; i <= len4; ++i)
        idx[w++] = tmp4[i];

    int res = solve(l, l + len1 - 1) && solve(l + len1, l + len1 + len2 - 1);

    if (!res)
        return false;

    if (!flg4)
        return solve(l + len1 + len2, l + len1 + len2 + len3 - 1) &&
               solve(l + len1 + len2 + len3, l + len1 + len2 + len3 + len4 - 1);

    return true;
}

int main() {
    int T = read();

    while (T--) {
        int m = read();

        // printf("%d\n", m);
        for (int t = 1; t <= m; ++t) {
            int n = read();
            // printf("%d:\n", t);
            // printf("%d\n", n);
            vec[t].resize(n);

            for (int i = 1; i <= n; ++i) {
                int lc = read(), rc = read();
                vec[t][i - 1] = mkp(lc - 1, rc - 1);
                // printf("%d %d\n", lc, rc);
            }

            idx[t] = t, p[t] = 0;
        }

        puts(solve(1, m) ? "Almost Complete" : "No");
    }

    return 0;
}