#include<cstdio>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<string.h>
#include<iomanip>
#include<stack>
#include<deque>
#include<queue>
#include<vector>
#include<map>
using namespace std;
typedef long long ll;
ll t, n, a[200005], p, b[200005];

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    cin >> t;
    while (t--)
    {
        cin >> n;
        deque<int>d;
        for (int i = 1; i <= n; i++)
        {
            cin >> p;
            d.push_back(p);
            b[i] = p;
        }
        for (int i = 1; i <= n; i++)
        {
            cin >> p;
            a[p] = i;
        }
        ll l, r, cur = 0;
        for (int i = 2; i <= n; i++)
        {
            if (a[b[i]] != a[b[i - 1]] + 1)
            {
                cur++;
            }
        }
        string ans = "";
        for (int i = 1; i <= n * n; i++)
        {
            l = d.front();
            d.pop_front();
            r = d.front();
            d.pop_front();
            if (cur == 1 && a[l] > a[r])
            {
                ans.push_back('1'); break;
            }
            if (a[l] != a[r] - 1)cur--;
            if (a[r] != a[d.front()] - 1)cur--;
            if (a[l] > a[r])
            {
                if (a[l] != a[d.front()] - 1)cur++;
                if (a[r] - 1 != a[d.back()])cur++;
                ans.push_back('2');
                d.push_front(l);
                d.push_back(r);
            }
            else
            {
                if (a[r] != a[d.front()] - 1)cur++;
                if (a[l] - 1 != a[d.back()])cur++;
                ans.push_back('1');
                d.push_front(r);
                d.push_back(l);
            }
            if (!cur)
            {
                break;
            }
        }
        cout << ans << endl;
    }
    return 0;
}