#include<bits/stdc++.h>

#define pb push_back
#define fi first
#define se second

typedef long long ll;
#define int ll

using namespace std;

int n;

vector<int> oper(vector<int> a, int o)
{ // o = {0, 1}
    int x = a.back();
    for (int i=n-1; i>=o+1; i--)
        a[i] = a[i-1];
    a[o] = x;
    return a;
}
vector<int> oper2(vector<int> a, int o)
{
    int x = a[o];
    for (int i=o; i+1<n; i++)
        a[i] = a[i+1];
    a[n-1] = x;
    return a;
}

void solve()
{
    cin>>n;
    vector<int> a(n);
    vector<int> b(n);
    for (int& i : a) cin>>i;
    for (int& i : b) cin>>i;

    vector<int> ans;
    for (int ok = 0; ok < n; ok++)
    {
        int pos = 0;
        for (int i=0; i<n; i++)
            if (a[(n-1-ok+1)%n] == b[i])
                pos = i;

        if (pos == 1)
        {
            continue;
        }
        else
        if (pos == 0)
        {
            ans.pb(0);
            b = oper(b, 0);
        }
        else
        {
            auto c = b;
            int id = pos;
            int cnt = 0;
            while (id < n-1)
            {
                ans.pb(1), id++, cnt++;
//                b = oper(b, 1);
            }
//        cout<<"a1\n";
//        for (int i : b)
//            cout<<i<<" ";
//        cout<<"\n";
            {
                ans.pb(0), cnt++;
//                b = oper(b, 0);
            }
//        cout<<"a2\n";
//        for (int i : b)
//            cout<<i<<" ";
//        cout<<"\n";
            while (cnt < n-1)
            {
                ans.pb(1), cnt++;
//                b = oper(b, 1);
            }
//        cout<<"a3\n";
//        for (int i : b)
//            cout<<i<<" ";
//        cout<<"\n";
            {
                ans.pb(0), cnt++;
//                b = oper(b, 0);
            }

//            cout<<"\nch\n";
//            for (int i : c) cout<<i<<" ";
//            cout<<"\n";

            int x = c[0];
            c[0] = c[n-1];
            for (int i=n-1; i>=1; i--)
                c[i] = c[i-1];
            c[1] = x;

//            cout<<"\nc\n";
//            for (int i : c) cout<<i<<" ";
//            cout<<"\n";
            swap(c[1], c[(pos+1)%n]);
            b = c;
//            if (b != c)
//                exit(1);
//            cout<<"b\n";
//            for (int i : b) cout<<i<<" ";
//            cout<<"\nc\n";
//            for (int i : c) cout<<i<<" ";
//            cout<<"\n";
        }
//        for (int i : b)
//            cout<<i<<" ";
//        cout<<"\n";
    }

//    for (int i : b) cout<<i<<" ";
//    cout<<"\n";

    reverse(ans.begin(), ans.end());
//    for (int i : ans)
//    {
//        a = oper2(a, i);
//        for (int i  :a)
//            cout<<i<<" ";
//        cout<<"\n";
//    }
    for (int i : ans)
        cout<<i+1;
    cout<<"\n";
}

main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t;
    cin>>t;
    while (t--)
        solve();
}
/*
2
3
1 2 3
2 3 1
4
1 2 3 4
2 1 3 4
*/