#include <bits/stdc++.h>

#define debug(...) 42;
#ifdef LOCAL
#include "debug.h"
#endif

using namespace std;
#define V vector
#define fi first
#define se second
#define mp make_pair
#define sz(a) ((int)a.size())
#define all(a) a.begin(), a.end()
#define F(i, l, r) for (int i = l; i < r; ++i)
#define R(i, l, r) for (int i = r-1; i >= l; --i)
typedef long long LL;
typedef double DB;
typedef pair<int, int> PII;
template<typename T> bool setmin(T &a, T b) { return (a > b ? a = b, 1 : 0); }
template<typename T> bool setmax(T &a, T b) { return (a < b ? a = b, 1 : 0); }
// mt19937_64 rng {chrono::steady_clock::now().time_since_epoch().count()};

/* -------------Main code------------- */
void solve() {
    int n; cin >> n;
    V<int> a(n), b(n);
    F(i, 0, n) cin >> a[i];
    V<int> nxt(n + 1);
    F(i, 0, n) cin >> b[i];
    F(i, 0, n) {
        nxt[b[i]] = b[(i + 1) % n];
    }

    int cur=1;
    string ans = "";
    F(i, 0, n - 1) {
        while (nxt[a[0]] !=a[cur]){
            cout<<2;
            ans += '2';
            cur++;
            if(cur==n)cur=1;
        } 
        cout<<1;
        ans += '1';
        swap(a[0],a[cur]);
        cur++;
        if(cur==n)cur=1;
    }
    if(a[0]!=b[0]){
        cout<<1;
        ans += '1';
        while(a[cur]!=b[0]){
            cout<<1;
            ans += 1;
            cur++;
            if(cur==n)cur=1;
        }
    }

    // for (char i : ans) {
    //     if (i == '1') {
    //         int t = a[0];
    //         a.erase(a.begin());
    //         a.push_back(t);
    //     } else {
    //         int t = a[1];
    //         a.erase(a.begin() + 1);
    //         a.push_back(t);
    //     }
    // }
    // assert(a == b);

    cout<<'\n';
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);

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

    return 0;
}