#include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <set>
#include <fstream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <algorithm>
#include <iterator>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <bitset>
#define ll long long
#define endl '\n'
#define inf 0x3f3f3f3f3f3f3f3f
using namespace std;
const ll N = 1e6 + 10, mod = 1;
ll n, m, k,a[N], ans = 0, maxx = 0, sum = 0, sum2 = 0;
queue<int>q;
void solve()
{
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>m;
		a[m]=1;
	}
	for(int i=1;i<=n;i++){
		cin>>m;
		a[m]=i;
	}
	for(int i=1;i<=n;i++){
		q.push(a[i]);
	}
	for(int i=1;i<=n;i++){
		m=q.front();
		q.pop();
		for(int j=1;j<=n-i;j++){
			k=q.front();
			q.pop();
			if(m<k){
				q.push(k);
				cout<<2;
			}
			else{
				q.push(m);
				m=k;
				cout<<1;
			}
		}
		for(int j=1;j<=i;j++){
			cout<<1;
		}
	}
	cout<<endl;
}

int main()
{
	ios::sync_with_stdio(false),
		cin.tie(0),
		cout.tie(0);
	int T = 1, hhyy;
	cin >> T;
	while (T--)
	{
		solve();
	}
}