#include <bits/stdc++.h>
#define int long long

using namespace std;

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

    vector <int> a (n), b (n);
    for (int i = 0; i < n; i ++) {
        cin >> a[i];
    }
    for (int i = 0; i < n; i ++) {
        cin >> b[i];
    }

    if (a == b) {
        cout << '\n';
        return;
    }

    vector <int> nxt (n + 1);
    for (int i = 0; i < n; i ++) {
        nxt[b[i]] = b[(i + 1) % n];
    }

    deque <int> q;
    for (int i = 0; i < n; i ++) {
        q.push_back (a[i]);
    }

    int ttt = 0;

    vector <int> oper; 
    while (true) {
        int cnt = 0;
        while (nxt[q[0]] == q[1]) {
            int x = q[0];
            q.pop_front ();
            q.push_back (x);
            x = q[0];
            q.pop_front ();
            q.push_back (x);
            cnt += 2;
            oper.push_back (1);
            oper.push_back (1);
            if (cnt == (n & 1 ? n * 2 : n)) {
                break;
            }
        }
        if (cnt == (n & 1 ? n * 2 : n)) {
            for (int j = 0; j < cnt; j ++) {
                oper.pop_back ();
            }
            break;
        }
        int x = q[0];
        q.pop_front ();
        while (q[0] != nxt[x]) {
            oper.push_back (2);
            int y = q[0];
            q.pop_front ();
            q.push_back (y);
        }
        q.push_back (x);
        x = q[0];
        q.pop_front ();
        q.push_back (x);
        oper.push_back (1);
        oper.push_back (1);
        // ttt ++;
        // if (ttt == 11) {
        //     break;
        // }
        // for (auto x : q) {
        //     cerr << x << " \n"[x == q.back ()]; 
        // }
    }

    // for (auto x : q) {
    //     cerr << x << " ";
    // }

    while (q[0] != b[0]) {
        oper.push_back (1);
        int x = q[0];
        q.pop_front ();
        q.push_back (x);
    }

    // cerr << oper.size () << '\n';
    for (auto x : oper) {
        cout << x;
    }    
    cout << '\n';
}

signed main () {
    ios::sync_with_stdio (false);
    cin.tie (nullptr);

    int T = 1;
    cin >> T;

    while (T --) {
        solve ();
    }

    return 0;
}