import math
import sys
import heapq
from typing import List, Tuple

int1 = lambda x: int(x) - 1
input = lambda: sys.stdin.readline().rstrip('\n')
ii = lambda: int(input())
vi = lambda: list(map(int, input().split()))
vi1 = lambda: list(map(int1, input().split()))


def dbg(*args, **kwargs):
    print(*(repr(arg) for arg in args), *(f'{k}: {repr(v)}' for k, v in kwargs.items()),
          sep='; ', file=sys.stderr, flush=True)


def main():
    t = ii()
    for i in range(t):
        n = ii()
        a = vi()
        b = vi()
        idx = sorted(range(n), key=lambda x: a[x])
        maxv = maxi = curv = 0
        for i in range(n):
            curv -= a[idx[i]]
            curv += b[i]
            if maxv < curv:
                maxv = curv
                maxi = i + 1
        ans = ['0'] * n
        for i in idx[:maxi]:
            ans[i] = '1'

        print(''.join(ans))


def _start():
    if (ret := main()) is not None:
        print(*ret) if isinstance(ret, List) or isinstance(ret, Tuple) else print(ret)


if __name__ == '__main__':
    _start()