#include<bits/stdc++.h>
typedef long long ll;
#define inf 1e7
using namespace std;
int t,n;

int a[1005],b[1005];
int ne[1005];
int pre[1005];
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin>>t;
    while(t--){
        cin>>n;
        queue<int> q;
        for(int i=1;i<=n;i++){
            cin>>a[i];
            q.push(a[i]);
            pre[a[i]]=1;
        }
        for(int i=1;i<=n;i++){
            cin>>b[i];
        }
        for(int i=1;i<=n;i++){
            ne[b[i]]=b[i+1];
        }
        ne[b[n]]=-1;
        while(1){
            int hd=q.front();
            queue<int> qq=q;
            bool ok=1;
            for(int i=1;i<=n;i++){
                if(qq.front()==b[i]){
                    qq.pop();
                }
                else{
                    ok=0;
                }
            }
            if(ok){
                break;
            }
            q.pop();
            if(ne[hd]==-1){
                q.push(hd);
                cout<<1;
                continue;
            }
            while(q.front()!=ne[hd]){
                int tp=q.front();
                q.pop();
                q.push(tp);
                cout<<"2";
            }
            pre[hd]=pre[q.front()]+1;
            q.push(hd);
            cout<<1;
            for(int i=1;i<pre[hd];i++){
                cout<<1;
                int tp=q.front();
                q.pop();
                q.push(tp);
            }
        }
        cout<<"\n";
    }

    return 0;
}