//16:35
#include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(false);cin.tie(0);
#define endl '\n'
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef tuple<int,LL,LL> TPL;
typedef pair<LL,LL> PII;
const int N=1e6+7,inf=0x3f3f3f3f;const LL Linf=0x3f3f3f3f3f3f3f3fLL;
LL qsm(LL a,LL b,LL p){LL res=1;while(b){if(b&1)res=res*a%p;a=a*a%p;b>>=1;}return res;}
LL lowbit(LL x){return x&-x;}
int n;
int a[N],b[N];
deque<int>q;
string ans;
void op1(){
    int x=q.front();
    q.pop_front();
    q.push_back(x);
    ans+='1';
}
void op2(){
    int x=q.front();
    q.pop_front();
    int y=q.front();
    q.pop_front();
    q.push_back(y);
    q.push_front(x);
    ans+='2';
}
void solve(){
    cin>>n;
    q.clear();
    for(int i=1;i<=n;i++)cin>>a[i],q.push_back(a[i]);
    for(int i=1;i<=n;i++)cin>>b[i];
    for(int i=1;i<=n;i+=2){
        while(q.front()!=b[i]){
            op1();
        }
        while(i+1<=n&&q[1]!=b[i+1]){
            op2();
        }
        op1();
        if(i+1<=n)op1();
    }
    while(q[0]!=b[1]){
        op1();
    }
    cout<<ans<<endl;
}
int main(){
   IOS
   int T=1;
   cin>>T;
    while(T--)solve();

    return 0;
}