#include <bits/stdc++.h>
#define isLeaf(x) (x && !ch[0][x] && !ch[1][x])

using namespace std;

const int N = 2e6 + 5;

int ch[2][N];
int son[4][N], rt, tot, ok[N];

void addTree(int &now, int x) {
    if (!now) {
        now = ++tot;
    }
    if (isLeaf(x)) {
        ok[now] = 1;
        return;
    }
    if (isLeaf(ch[0][x]) && isLeaf(ch[1][x])) {
        addTree(son[2][now], ch[0][x]);
        addTree(son[3][now], ch[1][x]);
        return;
    }
    if (!ch[0][x]) {
        addTree(son[1][now], ch[1][x]);
    }
    if (!ch[1][x]) {
        addTree(son[0][now], ch[0][x]);
    }
    if (ch[0][x] && isLeaf(ch[1][x])) {
        addTree(son[2][now], ch[0][x]);
    }
    if (ch[1][x] && isLeaf(ch[0][x])) {
        addTree(son[3][now], ch[1][x]);
    }
}

int grow(int x) {
    if (!x) return 0;
    if (ok[x]) return 1;
    return grow(son[0][x]) && grow(son[1][x]) && grow(son[2][x]) && grow(son[3][x]);
}

signed main() {
    int T; scanf("%d", &T);
    while (T--) {
        int n; scanf("%d", &n);
        while (n--) {
            int m; scanf("%d", &m);
            for (int i = 1; i <= m; ++i) {
                scanf("%d%d", &ch[0][i], &ch[1][i]);
            }
            addTree(rt, 1);
        }
        if (grow(1)) puts("Almost Complete");
        else puts("No");
        for (int i = 1; i <= tot; ++i) {
            son[0][i] = son[1][i] = son[2][i] = son[3][i] = ok[i] = 0;
        }
        rt = tot = 0;
    }
    return 0;
}