#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

int main(){
    int t;
    cin >> t;
    while(t--){
        int n;
        cin >> n;
        vector<pair<ll,int>>a(n);
        vector<ll>b(n);
        rep(i,n)cin >> a[i].first;
        rep(i,n)a[i].second=i;
        rep(i,n)cin >> b[i];
        reverse(b.begin(),b.end());
        sort(a.begin(),a.end());
        a.insert(a.begin(),{0,0});
        b.insert(b.begin(),0);
        rep(i,n)a[i+1].first+=a[i].first;
        rep(i,n)b[i+1]+=b[i];
        ll ans=1LL<<60;
        int ind=-1;
        rep(i,n+1){
            if(ans>a[i].first+b[n-i]){
                ans=a[i].first+b[n-i];
                ind=i;
            }
        }
        vector<char>s(n,'0');
        rep(i,ind+1){
            if(i==0)continue;
            s[a[i].second]='1';
        }
        for(char c:s)cout << c ;
        cout << endl;

    }
    return 0;
}