#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define maxn 100005
#define put() putchar('\n')
#define Tp template<typename Ty>
#define Ts template<typename Ty,typename... Ar>
using namespace std;
inline void read(int &x){
    int f=1;x=0;char c=getchar();
    while (c<'0'||c>'9') {if (c=='-') f=-1;c=getchar();}
    while (c>='0'&&c<='9') {x=x*10+c-'0';c=getchar();}
    x*=f;
}
namespace Debug{
	Tp void _debug(char* f,Ty t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,Ty x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	Tp ostream& operator<<(ostream& os,vector<Ty>& V){os<<"[";for(auto& vv:V) os<<vv<<",";os<<"]";return os;}
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
}using namespace Debug;
#define fi first
#define se second
#define mk make_pair
const int mod=1e9+7;
inline int power(int x,int y=mod-2) {
	int sum=1;
	while (y) {
		if (y&1) sum=sum*x%mod;
		x=x*x%mod;y>>=1;
	}
	return sum;
}
int n,a[maxn],b[maxn],Ans[maxn],id[maxn],tot;
void solve(void) {
	int i,j;
	read(n);
	for (i=1;i<=n;i++) read(a[i]);
	for (i=1;i<=n;i++) read(b[i]);
	for (i=n;i>=1;i--) {
		if (a[i]==b[i]) {
			if (i==1||a[i]==b[i/2]) Ans[i]=0;
			else if (a[i]>b[i/2]) Ans[i]=1;
			else Ans[i]=0;
		}
		else {
			int now=i/2;
			int fl=(a[i]>b[i]);
//			gdb(i,a[i],b[i],fl);
			id[tot=1]=i;
			while (now) {
				id[++tot]=now;
				if (b[now]==a[i]) break;
				now/=2;
			}
//			gdb(i,now);
			if (!now) return puts("Impossible"),void();
			if (now>1&&(a[i]>b[now/2])==fl) return puts("Impossible"),void();
			for (j=1;j<tot;j++) if ((a[i]>b[id[j]])!=fl) return puts("Impossible"),void();
			Ans[i]=fl;
			for (j=tot-1;j>=1;j--) swap(b[id[j+1]],b[id[j]]);
		}
	}
	for (i=1;i<=n;i++) printf("%d",Ans[i]);put();
}
signed main(void){
	int T;
	read(T);
	while (T--) solve();
	return 0;
}