#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll,ll> P;
#define REP(i,n) for(ll i=0;i<ll(n);i++)













int main(void){
	cin.tie(nullptr);  ios_base::sync_with_stdio(false);
	ll i,j;




	int T;
	cin >> T;
	while(T--){


		ll N;
		cin >> N;

		vector<P> a(N);
		vector<ll> b(N);

		REP(i,N){
			ll c;
			cin >> c;
			a[i]=P(c,i);
		}

		sort(a.begin(),a.end());

		for(i=1;i<N;i++) a[i].first+=a[i-1].first;

		REP(i,N) cin >> b[i];

		for(i=1;i<N;i++) b[i]+=b[i-1];

		ll mx=a[N-1].first,e=-1;
		REP(i,N){

			ll s=a[N-1].first-a[i].first+b[i];
			if(mx<s){
				e=i;
				mx=s;
			}

		}


		vector<ll> ans(N,0);
		for(i=0;i<=e;i++){
			ans[a[i].second]=1;
		}

		REP(i,N) cout << ans[i];
		cout << endl;



	}







	return 0;

}