#include <cstdio>

#include <cstring>

#include <cstdlib>

#include <algorithm>

#include <vector>

using namespace std;

typedef long long ll;

const int N = ;

const ll P = 1e9 + ;

int n[N], m, tot, head[N];

ll base[N], h[N][N], f[N];

vector <ll> g[N];

struct Edge {

    int to, nxt;

} e[N << ];

inline void add(int from, int to) {

    e[++tot].to = to;

    e[tot].nxt = head[from];

    head[from] = tot;

}

inline void read(int &X) {

    X = ; char ch = ; int op = ;

    for(; ch > '' || ch < ''; ch = getchar())

        if(ch == '-') op = -;

    for(; ch >= '' && ch <= ''; ch = getchar())

        X = (X << ) + (X << ) + ch - ;

    X *= op;

}

void dfs(int x, int fat) {

    g[x].clear();

    for(int i = head[x]; i; i = e[i].nxt) {

        int y = e[i].to;

        if(y == fat) continue;

        dfs(y, x);

        g[x].push_back(f[y]);

    }

    if(g[x].empty()) {

        f[x] = 1LL;

        return;

    }

    f[x] = 0LL;

    sort(g[x].begin(), g[x].end());

    int vecSiz = g[x].size();

    for(int i = ; i < vecSiz; i++)

        (f[x] += g[x][i] * base[i + ] % P) %= P;

}

inline bool chk(int x, int y) {

    for(int i = ; i <= n[x]; i++)

        if(h[x][i] != h[y][i]) return ;

    return ;

}

int main() {

    srand();

    for(int i = ; i <= ; i++)

        base[i] = rand() * rand() % P * rand() % P * rand() % P * rand() % P;

    read(m);

    for(int i = ; i <= m; i++) {

        tot = ;

        memset(head, , sizeof(head));

        read(n[i]);

        for(int fa, j = ; j <= n[i]; j++) {

            read(fa);

            if(fa) add(j, fa), add(fa, j);

        }

        for(int j = ; j <= n[i]; j++) {

            dfs(j, );

            h[i][j] = f[j];

        }

        sort(h[i] + , h[i] + n[i] + );

    }

    for(int i = ; i <= m; i++) {

        for(int j = ; j <= i; j++) {

            if(n[i] != n[j]) continue;

            if(chk(i, j)) {

                printf("%d\n", j);

                break;

            }

        }

    }

    return ;

}