#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>

#define ll long long

using namespace std;

const int N=1e6+7,inf = 2e9+77777777;

int read()
{
    int a = 0,x = 1;char ch = getchar();
    while(ch > '9' || ch < '0') {if(ch == '-') x = -1;ch = getchar();}
    while(ch >= '0' && ch <= '9') {a = a*10 + ch-'0';ch = getchar();}
    return a*x;
}

int n,b[N],p[N],o,ans[N];
struct node{
    int l,r,num;
}a[N];
int nxt() {return a[a[o].r].num;}
void op1() {o = a[o].r;}
void op2() 
{
    int xt1 = a[o].r;
    swap(a[o].num,a[xt1].num);
    op1();
}

void solve()
{
    n = read();o = 0;int cnt=  0;
    for(int i = 0;i < n;i ++) a[i].num = read(),a[i].l = (i+n-1)%n,a[i].r = (i+1)%n;
    for(int i = 0;i < n;i ++) b[i] = read();
    for(int i = 0;i < n;i ++) p[b[i]] = b[(i+1)%n];
    for(int i = 1;i <= n;i ++) {
        if(nxt() != p[a[o].num]) {
            ans[++cnt] = 2;
            op2();
        } else {
            ans[++cnt] = 1;
            op1();
        }
    }
    while(a[o].num != b[0]) {
        ans[++cnt] = 1;
        op1();
    }
    for(int i= 1;i <= cnt;i ++) printf("%d",ans[i]);
    puts("");
}

int main()
{
    // freopen("in.in","r",stdin);freopen("out.out","w",stdout);
    int T = read();
    while(T --) solve();
}