def solve():
    N = int(input())
    A = [0] + list(map(int, input().split()))
    B = [0] + list(map(int, input().split()))

    D_max = d = 0
    argmax = 0
    I = sorted(range(1, N + 1), key = lambda i : A[i])
    for k, a_ind in enumerate(I, 1):
        d += B[k] - A[a_ind]
        if D_max < d:
            D_max = d
            argmax = k

    S = [0] * (N + 1)
    for i in I[:argmax]:
        S[i] = 1
    return "".join(map(str, S[1:]))

#==================================================
import sys
input = sys.stdin.readline
write = sys.stdout.write

T = int(input())
write("\n".join([solve() for _ in range(T)]))