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


using namespace std;

const int N = 1000001;
int n;
int a[N], b[N];
map<int, int> mp;
bool check(int cur) {
    for(int i=1;i<=n;i++) {
        if(cur+i>n) {
            if(a[cur+i-n]!=b[i])
                return 0;
        }else{
            if(a[cur+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;
        int tmp;
        int i=1,j=2;
        while(1){
            if(i>n) i-=n;
            if(j>n) j-=n;
           if(mp[a[i]]<mp[a[j]]) {
               swap(a[i],a[j]);
               i=j;
               cout<<2;
           }else{
               i++;
               cout<<1;
           }
           j=i+1;
            if(check(i-1))break;
        }
        cout<<"\n";
    }


    return 0;
}