#include<bits/stdc++.h>
using namespace std;
const int N=1e6+1;
int n;
vector<int> a[N];
int finds(int x){
	if(a[x][0]==0){
		return x;
	}
	a[x][0]--;
	int ans=finds(a[x][a[x][0]+1]);
	a[x][0]++;
	return ans;
}
int main(){
	freopen("stack.in","r",stdin);
	freopen("stack.out","w",stdout);
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		int len;
		scanf("%d",&len);
		a[i].push_back(len);
		for(int j=1,x;j<=len;j++){
			scanf("%d",&x);
			a[i].push_back(x);
		}
	}
	for(int i=1;i<=n;i++){
		printf("%d ",finds(i));
	}
	return 0;
}