#include <bits/stdc++.h>
using namespace std;
int n,a[10004],into[10004],t,vis[10004];
vector<int>edge[10004];
queue<int>q;
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		while(cin>>t)
		{
			if(t==0)break;
			edge[i].push_back(t);
			into[t]++;
		}
	}
	for(int i=1;i<=n;i++)
		if(into[i]==0&&!vis[i])q.push(i),vis[i]=1;
	while(!q.empty())
	{
		int u=q.front();
		q.pop();
		cout<<u<<" ";
		for(int i=0;i<edge[u].size();i++)
		into[edge[u][i]]--;
		for(int i=1;i<=n;i++)
			if(into[i]==0&&!vis[i])q.push(i),vis[i]=1;
	}
	return 0;
}