#include <bits/stdc++.h>
using namespace std;
#define rep(i, x, limit) for (long long i = (long long)x; i < (long long)limit; i++)
#define REP(i, x, limit) for (long long i = (long long)x; i <= (long long)limit; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define el '\n'
#define spa " "
#define Yes cout << "Yes" << el
#define No cout << "No" << el
#define YES cout << "YES" << el
#define NO cout << "NO" << el
#define eps (1e-10)
#define Equals(a,b) (fabs((a) - (b)) < eps )
#define debug(x) cerr << #x << " = " << x << el
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vs = vector<string>;
using vb = vector<bool>;
const double pi = 3.141592653589793238;
const int inf = 1073741823;
const ll infl = 1LL << 60;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string abc = "abcdefghijklmnopqrstuvwxyz";
const ll MOD = 998244353;
#include<atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using vm = vector<mint>;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  ll t;cin>>t;
  while(t--){
    ll n;cin>>n;
    vl A(n),B(n),C(n);
    rep(i,0,n)cin>>A[i];
    rep(i,0,n)cin>>B[i];
    vector<pll> Ai(n);
    rep(i,0,n)Ai[i]={A[i],i};
    sort(all(Ai));
    sort(all(A));
    rep(i,0,n-1){
      A[i+1]+=A[i];
      B[i+1]+=B[i];
    }
    rep(i,0,n){
      C[i]=B[i]-A[i];
    }
    ll stc=-infl,mi=-1;
    rep(i,0,n){
      if(C[i]>stc){
        stc=C[i];
        mi=i;
      }
    }
    vl ans(n,0);
    if(stc>0){
      rep(i,0,mi+1){
        ans[Ai[i].second]=1;
      }
    }
    rep(i,0,n){
      cout<<ans[i];
    }
    cout<<el;
  }
}