#include <bits/stdc++.h>

using namespace std;
using ll = long long;

void solve() {
    int n;
    cin >> n;

    vector<int> a(n + 1), b(n + 1), id(n + 1), c(n + 1);
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
        id[a[i]] = i;
    }
    deque<int> q;
    for (int i = 1; i <= n; ++i) {
        cin >> b[i];
        c[i] = id[b[i]];
//        cerr << c[i] << " \n"[i == n];
        q.push_back(c[i]);
    }

    while (q.front() != n) {
        auto t = q.front();
        q.pop_front();
        q.push_back(t);
        cout << "1";
    }
    q.push_back(q.front());
    q.pop_front();
    cout << "1";

    for (int i = n - 1; i >= 1; --i) {
        while (q.front() != i) {
            q.push_back(q.front());
            q.pop_front();
            cout << "1";
        }
        q.pop_front();
        while (q.front() != i + 1) {
            q.push_back(q.front());
            q.pop_front();
            cout << "2";
        }
        q.push_front(i);
//        cout << "11";
    }
    cout << "\n";
}

int main() {
    cin.tie(nullptr) -> sync_with_stdio(false);

    int _;
    cin >> _;
    while (_--) solve();

    return 0;
}