#include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
int solve()
{
    int n;
    cin >> n;
    vector<int> a(n);
    auto b = a;
    auto pos = b;
    for (int i = 0; i < n; i++)
    {
        cin >> a[i];
    }
    for (int i = 0; i < n; i++)
    {
        cin >> b[i];
        pos[b[i] - 1] = i;
    }
    queue<int> q;
    for (int i = 0; i < n; i++)
    {
        q.push(pos[a[i] - 1]);
    }
    string s;
    while (q.front() != 0)
    {
        s.push_back('1');
        q.push(q.front());
        q.pop();
    }
    q.pop();
    for (int i = 1; i < n; i++)
    {
        bool flag = 0;
        s.push_back('1');
        q.push(i - 1);
        for (int j = 1; j < n; j++)
        {
            if (q.front() == i)
            {
                q.pop();
                flag = 1;
            }
            if (flag)
            {
                s.push_back('2');
            }
            else
            {
                s.push_back('1');
            }
            q.push(q.front());
            q.pop();
        }
    }
    s.push_back('1');
    cout << s << "\n";

    return 0;
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int test = 1;
    cin >> test;
    while (test--)
    {
        solve();
    }
    return 0;
}