#include<bits/stdc++.h>

using namespace std;

// #define int long long
#define pb push_back
#define F first 
#define S second 

const int mol=998244353;
const int N = 3e5+5;

vector<int>node[N];
int a[N*2], lst[N], fa[N];
bool vis[N], vv[N], in[N];
vector<int>un;
int iu=0;
int n;
void dfs(int v, int pre){
    assert(v!=0);
    assert(vv[v]==0);
    vv[v]=1;
    iu++;
    a[iu]=v;
    while(iu<n*2-1&&a[iu+1]){ if(a[iu+1]==pre) return;if(vv[a[iu+1]]) return;  dfs(a[iu+1], v), iu++, a[iu]=v;}
    assert(iu<=n*2-1);
    int nn=-1;
    for(int i: node[v]){
        if(i==pre) continue;
        if(!in[i]&&!vv[i]) nn=i; 
    }
    
    if(v==pre){
        if(un.size()==0&&nn!=-1){
            dfs(nn, v);
            iu++;a[iu]=v;
            return;
        }
        while(un.size()&&un.back()<v) {
            if(nn!=-1&&!vv[nn]&&nn<un.back()) {dfs(nn, v);a[++iu]=v;break;}
            int g=un.back(); un.pop_back();
            dfs(g, v), a[++iu]=v;
        }
        while(un.size()) {
            if(nn!=-1&&!vv[nn]&&nn<un.back()) {dfs(nn, v);a[++iu]=v;break;}
            a[++iu]=un.back(), a[++iu]=v, un.pop_back();
        }
        if(nn!=-1&&!vv[nn]) dfs(nn, v), iu++, a[iu]=v;
        while(iu<n*2-1&&a[iu+1]){ dfs(a[iu+1], v), iu++, a[iu]=v;}
        assert(iu<=n*2-1);
        return;
    }
        while(un.size()&&un.back()<pre){
            if(nn!=-1&&!vv[nn]&&nn<un.back()) {dfs(nn, v);a[++iu]=v;break;}
            if(un.back()<v){
                int g=un.back();
                un.pop_back();
                dfs(g, v), a[++iu]=v ;
            }
            else a[++iu]=un.back(), a[++iu]=v, un.pop_back();
        }
        if(lst[v]>iu){
            
            while(un.size()&&un.back()<v) {
                if(nn!=-1&&!vv[nn]&&nn<un.back()) {dfs(nn, v);a[++iu]=v;break;}
                int g=un.back();un.pop_back();dfs(g, v), a[++iu]=v;
            }
            while(un.size()) {
                if(nn!=-1&&!vv[nn]&&un.back()>nn){
                    dfs(nn, v);
                    iu++;a[iu]=v;
                    break;
                }
                a[++iu]=un.back(), a[++iu]=v, un.pop_back();
            }
            if(nn!=-1&&!vv[nn]) dfs(nn, v), a[++iu]=v;
            assert(iu<=n*2-1);
            while(iu<n*2-1&&a[iu+1]){ if(a[iu+1]==pre) return;dfs(a[iu+1], v), iu++, a[iu]=v;assert(iu<=n*2-1);}
            
            assert(iu<=n*2-1);
        }
        else {
            if(nn!=-1&&!vv[nn]) dfs(nn, v), a[++iu]=v;
        }
}
void d(int v, int pre){
    fa[v]=pre;
    for(int k: node[v]){
        if(k==pre) continue;
        d(k, v);
    }
}

void solve(){
    iu=0;
    cin>>n;

    for(int i=1;i<=n;i++) vis[i]=0, node[i].clear(), vv[i]=0, lst[i]=0, in[i]=0, fa[i]=0;
    un.clear();
    a[n*2]=0;
    for(int i=1;i<=n*2-1;i++){
        cin>>a[i];
        lst[a[i]]=i;
        vis[a[i]]=1;
        if(i>1&&a[i-1]&&a[i]){
            node[a[i-1]].pb(a[i]);
            node[a[i]].pb(a[i-1]);
        }
    }
    for(int i=1;i<=n;i++){
        if(!vis[i]) un.pb(i);
    }
    reverse(un.begin(), un.end());
    int r;
    if(!a[1]&&!a[n*2-1]){
        for(int i=2;i<=n;i++) cout<<"1 "<<i<<" ";
        cout<<"1\n";
        return;
    }
    else r=max(a[1], a[n*2-1]); 
    a[1]=r, a[n*2-1]=r;
    d(r, r);
    for(int i=2;i<=n*2-1;i++){
        if(a[i-1]==fa[a[i]]&&a[i-1]&&a[i]) in[a[i]]=1;
    }
    dfs(r, r);

    for(int i=1;i<=n*2-1;i++) cout<<a[i]<<" ";cout<<"\n";
}

signed main(){
    ios::sync_with_stdio(0);cin.tie(0);
    int t;
    cin>>t;
    while(t--)
    solve();
    return 0;
}