#include <bits/stdc++.h>
using namespace std;
#define MAXN 1000
int a[MAXN+5], b[MAXN+5], p[MAXN+5], vis[MAXN+5];
void solve() {
    int n; scanf("%d", &n);
    for(int i = 1; i <= n; ++i) scanf("%d", a+i);
    for(int i = 1; i <= n; ++i) scanf("%d", b+i), vis[b[i]] = i;
    // for(int i = 1; i <= n; ++i) printf("%d ", vis[i]); putchar('\n');
    for(int i = 1; i <= n; ++i) p[a[i]] = vis[i];
    // for(int i = 1; i <= n; ++i) printf("%d ", p[i]); putchar('\n');
    int ip = 1;
    int cnt = 0;
    for(int i = n-1; i >= 1; --i) {
        while( p[ip] != i ) {
            putchar('1');
            ip = ip % n + 1;
            ++cnt;
        }
        while( p[ip%n+1] != i+1 ) {
            putchar('2');
            swap(p[ip], p[ip%n+1]);
            ip = ip % n + 1;
            ++cnt;
        }
    }
    assert(cnt <= n * n);
    putchar('\n');
}
int main() {
    int T; scanf("%d", &T);
    while( T-- ) solve();
    return 0;
}