#include<bits/stdc++.h>
using namespace std;
const int N = 100010;
int q[N], d[N];
int e[N], h[N], ne[N], idx;
int n,k;

void add(int a, int b) {
	e[idx] = b;
	ne[idx] = h[a];
	h[a] = idx++;
}

void topsort() {
	int hh = 0, tt = -1;
	for (int i = 1; i <= n; i++) {
		if (d[i] == 0)q[++tt] = i;


	}
	while (hh <= tt) {
		int t = q[hh++];
		for (int i = h[t]; i != -1; i = ne[i]) {
			int j = e[i];
			if (--d[j] == 0)
				q[++t] = j;
		}
	}
}

int main() {
	cin >> n;

	memset(h, -1, sizeof h);

	for (int i = 1; i <= n; i++) {
		while(cin>>k){
		    
		    
    if(k==0)break;
   //为什么要加这句话才能ac，while不是已经可以判0了吗
		
		
		add(i, k);
		d[k]++;
		}
		

	}
	topsort();
	for (int i = 0; i < n; i++) {
		cout << q[i] << ' ';
	}
}