#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MAXN = 2e5 + 5;
ll Tex, n, x;
string a, b;
void AC(){
    cin >> n;
    a.clear(); b.clear();
    a = " "; b = " ";
    for(int i = 1; i <= n; i ++){
        cin >> x;
        a.push_back(x + '0');
    }
    for(int i = 1; i <= n; i ++){
        cin >> x;
        b.push_back(x + '0');
    }
    for(int i = n; i >= 1; i --){
        if(b[i] == a[i]) continue;
        ll idx = a.find(b[i]);
        // cout << " " << i << "\n";
        string q1, q2, q3, q4;
        q4.push_back(b[i]);
        if(idx - 1 > 0) q1 = a.substr(1, idx - 1);
        if(i - idx > 0) q2 = a.substr(idx + 1, i - idx);
        if(n - i > 0) q3 = a.substr(i + 1, n - i);
        if(i == n){
            cout << string(idx, '1');
        }
        else{
            cout << string(idx - 1, '1');
            cout << string(i - idx, '2');
            cout << string(n - i + 1, '1');
        }
        a.clear(); a = " ";
        if(q1.size()) a += q1;
        if(q2.size()) a += q2;
        if(q4.size()) a += q4;
        if(q3.size()) a += q3;
    }
    cout << endl;
}
int main(){
    // freopen("L.in", "r", stdin);
    ios::sync_with_stdio(false);
    // cin.tie(0);cout.tie(0);
    cin >> Tex;
    while(Tex --) AC();
    return 0;
}