#include <bits/stdc++.h>
using namespace std;
int n;
vector <int> a[10005];
vector <int> c[10005];
int dfs (int i, int ans) {
    if (ans == n) return ans;   
    if (c[i][0] == 1) dfs(c[i][1], ans + 1);
    else return ans;
}
int main () {
    freopen ("catas.in", "r", stdin);
    freopen ("catas.out", "w", stdout);
    cin >> n;
    for (int i = 1; i <= n; i++) {
        a[i].push_back(0);
        while (1) {
            a[i][0]++;
            int x;
            cin >> x;
            c[x].push_back(0);
            c[x][0]++;
            if(x==0){
                break;
            }
            a[i].push_back(x);
            c[x][c[x][0]] = i;
            cout << a[i][a[i][0]] << endl << c[x][c[x][0]] << endl;
        }
    }
    for (int i = 1; i <= n; i++) {
        cout << dfs(i, 0) << endl;
    }
    return 0;
}