#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)

using p = pair<ll, int>;
void solve(){
    int n; cin >> n;
    vll a(n); rep(i, n)cin >> a[i];
    vector<p> vp; rep(i, n)vp.push_back({a[i], i});
    vll b(n); rep(i, n)cin >> b[i];
    sort(all(vp));
    int k = 0; ll mx = 0, sum = 0; rep(i, n){
        mx+= a[i];
        sum += a[i];
    }
    ll t = 0;
    rep(i, n){
        sum -= vp[i].first;
        t += b[i];
        if(mx < sum + t){
            k = i+1;
            mx = sum+t;
        }
    }
    vi ans(n, 0);
    rep(i, k)ans[vp[i].second] = 1;
    rep(i, n)cout << ans[i];
    cout << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t; cin >> t;
    while(t--)solve();

    return 0;
}