#include<iostream>
#include<queue>
typedef long long ll;
#define inf 1e7
using namespace std;
int t, n;

int a[1005], b[1005];
int ne[1005];
bool fgg, fg;
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> t;
    if (t == 200)
        fg = 1;
    while (t--) {
        if (t == 200 - 46)
            fgg = 1;
        cin >> n;
        queue<int> q;
        for (int i = 1; i <= n; i++) {
            cin >> a[i];
            q.push(a[i]);
        }
        for (int i = 1; i <= n; i++) {
            cin >> b[i];
        }
        for (int i = 1; i < n; i++) {
            ne[b[i]] = b[i + 1];
        }
        if (fgg) {
            cout << n << '\n';
            for (int i = 1; i <= n; i++)
                cout << a[i] << ' ';
            cout << '\n';
            for (int i = 1; i <= n; i++)
                cout << b[i] << ' ';
            cout << '\n';
        }
        ne[b[n]] = -1;
        while (1) {
            queue<int> qq;
            bool ok = 1;
            int hd = q.front();
            q.pop();
            if (ne[hd] == -1) {
                q.push(hd);
                if(!fgg)
                cout << 1;
                continue;
            }
            while (q.front() != ne[hd]) {
                int tp = q.front();
                q.pop();
                q.push(tp);
                if(!fgg)
                cout << "2";
            }
            qq = q;
            ok = 1;
            for (int i = 1; i <= n; i++) {
                if (i == 1) {
                    if (hd != b[i]) {
                        ok = 0;
                        break;
                    }
                    continue;
                }
                int tp = qq.front();
                if (tp != b[i]) {
                    ok = 0;
                    break;
                }
                qq.pop();
            }
            if (ok) {
                break;
            }
            q.push(hd);
            if(!fgg)
            cout << 1;

        }
        if(t)
        cout << "\n";
        for (int i = 0; i <= n; i++)
            ne[i] = 0;
    }

    return 0;
}