#include <iostream>
#include <cstring>
#include <algorithm>
#include <map>
#include <vector>
#include <set>
#include <queue>
#include <cmath>
#include <stack>
#include <cstring>
#include <iomanip>
#include <unordered_map>
#include <numeric>
 
#define sc_int(x) scanf("%d", &x)
 
#define x first
#define y second
#define pb push_back

using namespace std;

const int N = 110, M = 50, MOD = 1e9 + 7;
const int inf = 1e9;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<string, int> PSI;
typedef pair<LL, LL> PLL;
typedef pair<double, double> PDD;
typedef pair<char, int> PCI;
typedef pair<string, string> PSS;

int n, m;


void solve() 
{
	cin >> n;
	vector<int> a(n), b(n), lef(n + 1);
	deque<int> deq;
	for(int i = 0; i < n; i ++) cin >> a[i], deq.push_back(a[i]);
	for(int i = 0; i < n; i ++) cin >> b[i];
	lef[b[0]] = b[n - 1];
	for(int i = 1; i < n; i ++) lef[b[i]] = b[i - 1];
	vector<int> res;
	for(int i = 0; i < n; i ++)
	{
		auto t1 = deq.front();
		deq.pop_front();
		auto t2 = deq.front();
		deq.pop_front();
		while(lef[t2] != t1) 
		{
			deq.pb(t2);
			t2 = deq.front();
			deq.pop_front();
			res.pb(2);
		}
		res.pb(1);
		deq.pb(t1);
		res.pb(2);
		deq.pb(t2);
	}
	if(deq.front() != b[0]) res.pb(1);
//	cout << deq.front() << endl;
	for(auto t : res) cout << t;
	cout << endl;
}


int main()
{
//  freopen("input.txt","r",stdin);
//  freopen("output.txt","w",stdout);
//  ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
     
    int T = 1;
    cin >> T;
    while(T --)
    {
        solve();
    }
}