#include<bits/stdc++.h>

using namespace std;

string solve() {
    int N; cin >> N;
    vector<int> A(N), B(N);
    for (int i = 0; i < N; i++) { cin >> A[i]; }
    for (int j = 0; j < N; j++) { cin >> B[j]; }

    vector<int> I(N);
    for (int i = 0; i < N; i++) { I[i] = i; }

    sort(I.begin(), I.end(), [&](int i, int j) { return A[i] < A[j]; } );

    long long D_max = 0, d = 0;
    int argmax = 0;
    for (int k = 1; k <= N; k++) {
        d += B[k - 1] - A[I[k - 1]];
        if (D_max < d) {
            D_max = d;
            argmax = k;
        }
    }

    string S(N, '0');
    for (int k = 1; k <= argmax; k++) {
        S[I[k - 1]] = '1';
    }

    return S;
}

int main() {
    int T; cin >> T;
    for (int t = 1; t <= T; t++) {
        cout << solve() << endl;
    }
}