#include <bits/stdc++.h>
using namespace std;

#define QwQ330AwA return 0
#define ll long long

int n;
vector <int> stk[100005];
int tag[100005];
int to[100005];
int ans[100005];

int dfs(int u) {
	if (!tag[u]) return ans[u] = u;
	if (ans[u]) return ans[u];
	return ans[u] = dfs(to[u]);
}

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n;
	for (int i = 1, siz; i <= n; i++) {
		cin >> siz;
		for (int j = 1, x; j <= siz; j++) cin >> x, stk[i].push_back(x);
		reverse(stk[i].begin(), stk[i].end());
	}
	for (int i = 1; i <= n; i++) {
		if (tag[i]) continue;
		if (stk[i].empty()) continue;
		int u = i;
		while (!tag[u] && !stk[u].empty()) {
			tag[u] = i;
			to[u] = stk[u].back();
			stk[u].pop_back();
			u = to[u];
			if (tag[u] == i) {//消环
				int uu = u;
				while (tag[uu] == i) tag[uu] = 0, uu = to[uu];
			}
		}
	}
//	for (int i = 1; i <= n; i++) cout << to[i] << ' ' << tag[i] << endl;
	for (int i = 1; i <= n; i++) cout << dfs(i) << ' ';
	QwQ330AwA;
}