#include <bits/stdc++.h>
using namespace std;
#define INF 1e12
const int N=1e6+5;
typedef pair<int,int> P;
typedef long long ll;
typedef pair<ll,ll>Pll;
typedef __int128 i128;
const ll mod=1e9+7;
typedef long double db;
const db eps=1e-10;
mt19937_64 rnd(time(0));
void solve(){
    int n;
    cin >> n;
    map<int,map<int,int>>mp;
    vector<int>a[n];
    for(int i=0;i<n;i++){
        int k;
        cin >> k;
        for(int j=0;j<k;j++){
            int x;
            cin >> x;
            a[i].push_back(x);
            mp[i][x]++;
        }
    }
    auto las=[&](int i){
        return (i-1+n)%n;
    };
    auto nxt=[&](int i){
        return (i+1)%n;
    };
    vector<int>ans(n);
    ans[0]=a[0][0];
    for(int i=1;i<n;i++){
        if(mp[i][ans[las(i)]]) ans[i]=ans[las(i)];
        else ans[i]=a[i][0];
    }
    for(int i=0;i<n;i++){
        if(mp[i][ans[las(i)]]) ans[i]=ans[las(i)];
        else break;
    }
    for(auto x:ans) cout << x << " ";
}
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t=1;
    //cin >> t;
    while(t--)
    solve();
}