#include <bits/stdc++.h>

#define int long long
#define OobugoO_IOS std::ios::sync_with_stdio(false), std::cin.tie(nullptr)
#define X first
#define Y second
#define pii pair<int, int>
#define pll pair<long long, long long>

typedef long long ll;
typedef long double LD;

// using namespace std;

// const int mod = 998244353;
const int mod = 1e9 + 7;
const int N = 3005;
const int M = 210;
const LD eps = 1e-8;

void solve() {
    int n;  std::cin >> n;
    std::vector<int> a(n), b(n);
    for (int i = 0; i < n; i++) {
        std::cin >> a[i];
    }
    for (int i = 0; i < n; i++) {
        std::cin >> b[i];
    }
    int st = 0;
    for (int i = 1; i < n; i++) {
        while (a[st] != b[i-1]) {
            std::cout << 1;
            a.push_back(a[st++]);
        }
        int nex = st + 1;
        while (a[nex] != b[i]) {
            std::cout << 2;
            a.push_back(a[nex++]);
        }
        std::cout << 1;
        a.push_back(a[st]);
        st = nex;
    }
    while(a[st] != b[0]) {
        std::cout << 1;
        a.push_back(a[st++]);
    }
    std::cout << '\n';
} 

signed main() {

#ifdef Onlion_Judge
    freopen("IO/input.in", "r", stdin);
    freopen("IO/output.out", "w", stdout);
#endif

    OobugoO_IOS;
    int t = 1;  std::cin>>t;
    while (t--) {
        solve();
    }
    return 0;
}