// 那就是希望。
// 即便需要取模，也是光明。

#include <algorithm>
#include <stdio.h>
#include <vector>
typedef long long llt;
typedef unsigned uint;typedef unsigned long long ullt;
typedef bool bol;typedef char chr;typedef void voi;
typedef double dbl;
template<typename T>bol _max(T&a,T b){return(a<b)?a=b,true:false;}
template<typename T>bol _min(T&a,T b){return(b<a)?a=b,true:false;}
template<typename T>T lowbit(T n){return n&-n;}
template<typename T>T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<typename T>T lcm(T a,T b){return(a!=0||b!=0)?a/gcd(a,b)*b:(T)0;}
template<typename T>T exgcd(T a,T b,T&x,T&y){if(b!=0){T ans=exgcd(b,a%b,y,x);y-=a/b*x;return ans;}else return y=0,x=1,a;}
template<typename T>T power(T base,T index,T mod)
{
    T ans=1%mod;
    while(index)
    {
        if(index&1)ans=ans*base%mod;
        base=base*base%mod,index>>=1;
    }
    return ans;
}
// Heaven and Earth... My guiding star...
// Akira Complex R.I.P.
std::vector<uint>Way[1000005],V;uint W[1000005];
voi dfs(uint p,uint f)
{
    for(uint j=Way[p].size()-1;~j;j--)
        if(Way[p][j]==f)Way[p].erase(Way[p].begin()+j);else dfs(Way[p][j],p),_min(W[p],W[Way[p][j]]);
    if(Way[p].size()<2)_min(W[p],p);else if(W[Way[p][0]]>W[Way[p][1]])std::swap(Way[p][0],Way[p][1]);
}
voi dfs2(uint p)
{
    if(W[p]==p)V.push_back(p);
    if(Way[p].empty())return;
    dfs2(Way[p][0]);if(W[p]!=p)V.push_back(p);
    if(Way[p].size()==2)dfs2(Way[p][1]);
}
int main()
{
#ifdef MYEE
    freopen("QAQ.in","r",stdin);
    freopen("QAQ.out","w",stdout);
#endif
    uint n;scanf("%u",&n);
    for(uint i=0,d;i<n;i++){scanf("%u",&d),Way[i].resize(d),W[i]=-1;for(auto&s:Way[i])scanf("%u",&s),s--;}
    uint p=0;while(Way[p].size()==3)p++;
    dfs(p,-1);
    while(true)
    {
        V.push_back(p);
        if(Way[p].empty())break;
        else if(Way[p].size()==1){p=Way[p][0];if(p>W[p]){dfs2(p);break;}}
        else dfs2(Way[p][0]),p=Way[p][1];
    }
    for(uint i=0;i<n;i++)printf("%u%c",V[i]+1," \n"[i==n-1]);
    return 0;
}

// 那就是希望。
// 即便需要取模，也是光明。