#include <iostream>
#include <cstdio>
#include <vector>
#include <map>


using namespace std;

const int N = 10001;
int n;
int a[N], b[N], c[N];
map<int, int> mp;
bool check() {
    for(int i=1;i<=n;i++) {
        if(a[i]!=b[i])
            return 0;
    }
    return 1;
}
int main() {
    int t;
    cin >> t;
    while (t--) {
        cin >> n;
        for (int i = 1; i <= n; i++)
            cin >> a[i];
        for (int i = 1; i <= n; i++)
            cin >> b[i], mp[b[i]] = i;
        for (int i = 0; i < n; i++)
            c[i] = mp[a[i]];
        int tmp;
        int i = 1, j = 2;
        while (1) {
            if (i > n) i -= n;
            if (j > n) j -= n;
            if (i == 1) {
                if (check()) break;
            }
            if (c[i] > c[j]) {
                swap(a[i], a[j]);
                cout << 2;
            } else {
                cout << 1;
            }
            i++;
            j = i + 1;
        }
        cout << "\n";
    }


    return 0;
}