#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> PII;
typedef pair<PII,ll> PIII;
#define endl '\n'
#define x first
#define y second
const ll N =2e5+100,M=30,INF = 1e18;
ll n,a[N],b[N];
deque<ll> q;
bool check(){
	deque<ll> pp=q;
	ll idx=1;
	while(!pp.empty()){
		ll x=pp.front();
		pp.pop_front();
		if(x==idx) idx++;
		else return false;
	}
	return true;
}
void solve(){
	cin>>n;
	vector<ll> ans;
	map<ll,ll> pos;
	for(ll i=1;i<=n;i++){
		cin>>a[i];
		pos[a[i]]=i;
	}
	for(ll i=1;i<=n;i++) cin>>b[i];
	for(ll i=1;i<=n;i++){
		if(b[i]!=i){
			a[pos[b[i]]]=i;
			b[i]=i;
		}
	}
	q.clear();
	for(ll i=1;i<=n;i++) q.push_back(a[i]);
	if(check()){
		cout<<endl;
		return ;
	}
	bool flag=true;
	if(n%2==0){
	    for(ll i=1;i<=n;i+=2){
		if(a[i]+1!=a[i+1]) flag=false;
	    }
	    if(flag){
	    	ll x=q.front();
	    	q.pop_front();
	    	ans.push_back(1);
	    	q.push_back(x);
	    }
	}
	while(1){
		if(check()) break;
		ll x=q.front();
		q.pop_front();
		ll y=q.front();
		if(x==n){
			q.push_back(x);
			ans.push_back(1);
		}
		else if(x+1==y){
			while(x+1==y){
				ans.push_back(1);
				q.push_back(x);
				x=y;
				q.pop_front();
				y=q.front();
			}
			q.push_back(x);
			ans.push_back(1);
		}
		else{
			while(x+1!=y){
				q.pop_front();
				q.push_back(y);
				ans.push_back(2);
				y=q.front();
			}
			q.push_front(x);
		}
	}
	for(auto j:ans) cout<<j;
	cout<<endl;
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	ll __=1;cin>>__;
    while(__--) solve();
    return 0;
}