#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2005;
int n, a[N], b[N];
void solve(){
	scanf("%d", &n);
    for(int i = 1; i <= n; i++) scanf("%d", &a[i]);
    for(int i = 1; i <= n; i++){
        int tmp; scanf("%d", &tmp);
        b[tmp] = i;
    }
	deque<int>q;
    for(int i = 1; i <= n; i++) q.push_back(b[a[i]]);
	for(int i = 1; i <= n; i++){
		while(q.front() != i)  q.push_back(q.front()),q.pop_front(), printf("1");
		q.pop_front();
		if(i == 1){
			q.push_back(1), printf("1");
			continue;
		}
		while(q.front() != i - 1) q.push_back(q.front()),q.pop_front(), printf("2");
		q.push_back(q.front()),q.pop_front(), printf("2");
		q.push_back(i), printf("1");
	}
}

int main(){
	int t;
	scanf("%d",&t);
	while(t--){
		solve();
		if(t) printf("\n");
	}
	
	return 0;	
}