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

signed main(){
  int n;cin>>n;
  vector<int> edge[n];
  for(int i=0;i<n;i++){
    int p;cin>>p;
    while(p--){
      int a;cin>>a;
      edge[i].push_back(a);
    }
  }
  vector<int> nxt(n);for(int i=0;i<n;i++)nxt[i]=(i+1)%n;
  vector<int> now(n,0);
  int A=0;while(!edge[A].size())A++;
  while(1){
    cout<<edge[A][now[A]++]<<" ";
    while(nxt[A]!=A&&now[nxt[A]]>=edge[nxt[A]].size())nxt[A]=nxt[nxt[A]];
    if(nxt[A]!=A)A=nxt[A];
    else break;
  }
  while(now[A]<edge[A].size())cout<<edge[A][now[A]++]<<" ";
  cout<<endl;
}