#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 main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin>>t;
    while(t--){
        cin>>n;
        queue<int> q;
        int cnt=0;
        for(int i=1;i<=n;i++){
            cin>>a[i];
            q.push(a[i]);
        }
        for(int i=1;i<=n;i++){
            cin>>b[i];
            ne[b[i]]=b[i-1];
        }
        for(int i=1;i<=n;i++){
            ne[b[i]]=b[i+1];
        }
        ne[b[n]]=-1;
        int hd;
        while(1){
            queue<int> qq;
            bool ok=1;
            hd=q.front();
            q.pop();
            if(ne[hd]==-1){
            	q.push(hd);
            	cout<<1;
            	cnt++;
            	continue;
			}
            while(q.front()!=ne[hd]){
                int tp=q.front();
                q.pop();
                q.push(tp);
                cout<<2;
                cnt++;
            }
            qq=q;
            ok=1;
            for(int i=1;i<=n;i++){
                if(i==1){
                    if(hd!=b[i]){
                        ok=0;
                        break;
                    }
                    continue;
                }
                int tp=qq.front();
                if(tp!=b[i]){
                    ok=0;
                    break;
                }
                qq.pop();
            }
            if(ok){
                break;
            }
            q.push(hd);
            cout<<1;
            cnt++;
			while(ne[q.back()]==q.front()){
            	hd=q.front();
            	q.pop();
            	q.push(hd);
            	cout<<1;
            	cnt++;
			}
			if(cnt>=n*n) break;
        }
        if(t==0) break;
        cout<<"\n";
    }

    return 0;
}