#pragma GCC optimize(3, "-Ofast", "inline")
#include <bits/stdc++.h>
using namespace std;
#define Getchar() (P1 == P2 && (P2 = (P1 = BUF) + fread(BUF, 1, 1 << 21, stdin), P1 == P2) ? EOF : *P1++)
char BUF[1 << 21], *P1 = BUF, *P2 = BUF;
inline int read() {
    int res = 0, f = 1;
    char ch = Getchar();
    while (ch < '0' || ch > '9') {
        if (ch == '-')
            f = -1;
        ch = Getchar();
    }
    while (ch >= '0' && ch <= '9') res = (res << 3) + (res << 1) + ch - 48, ch = Getchar();
    return res * f;
}
const int N = 2e6 + 5;
vector<int> rt;
int lc[N], rc[N], n, m, tot, T;
#define pd(to) (!lc[to] && !rc[to])
bool solve(const vector<int>& t) {
    if (t.empty())
        return false;
    for (const int& to : t)
        if (pd(to))
            return true;
    vector<int> t1, t2, t3, t4;
    for (const int& to : t) {
        if (!lc[to])
            t2.push_back(rc[to]);
        if (!rc[to])
            t1.push_back(lc[to]);
        if (lc[to] && rc[to]) {
            if (pd(lc[to]))
                t3.push_back(rc[to]);
            if (pd(rc[to]))
                t4.push_back(lc[to]);
        }
    }

    return solve(t1) && solve(t2) && solve(t3) && solve(t4);
}
int main() { 
    T = read();
    while (T--) {
        tot = 0;
        rt.clear();
        m = read();
        rt.reserve(m);
        for (int i = 1; i <= m; i++) {
            n = read();
            rt.push_back(tot + 1);
            for (int j = 1; j <= n; j++) {
                lc[tot + j] = read();
                if (lc[tot + j])
                    lc[tot + j] += tot;
                rc[tot + j] = read();
                if (rc[tot + j])
                    rc[tot + j] += tot;
            }
            tot += n;
        }
        if (solve(rt))
            printf("Almost Complete\n");
        else
            printf("No\n");
    }
    return 0;
}