#include <bits/stdc++.h>

using namespace std;

int main() {
    int T;
    cin >> T;
    while (T--) {
        int N;
        cin >> N;
        vector<pair<int, int>> A(N);
        vector<int> B(N);
        for (int i = 0; i < N; i++) {
            cin >> A[i].first;
            A[i].second = i;
        }
        for (int i = 0; i < N; i++) {
            cin >> B[i];
        }
        sort(A.begin(), A.end());
        vector<long long> C(N + 1);
        for (int i = 1; i <= N; i++) {
            C[i] = C[i - 1] - A[i - 1].first + B[i - 1];
        }
        auto itr = max_element(C.begin(), C.end());
        string ans = string(N, '0');
        for (int i = 0; i < distance(C.begin(), itr); i++) {
            ans[A[i].second] = '1';
        }
        cout << ans << endl;
    }
    return 0;
}