using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;
using System.Security.Cryptography;
using Microsoft.VisualBasic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    static int[] LList(long n) => Enumerable.Repeat(0, (int)n).Select(_ => int.Parse(ReadLine())).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var t = NN;
        var ans = new string[t];
        for (var u = 0; u < t; ++u)
        {
            var n = NN;
            var a = NList;
            var b = NList;
            var list = new (int id, int val)[n];
            for (var i = 0; i < n; ++i) list[i] = (i, a[i]);
            Array.Sort(list, (l, r) => l.val.CompareTo(r.val));
            var tmp = 0L;
            for (var i = 0; i < n; ++i) tmp += a[i];
            var max = tmp;
            var maxi = 0;
            for (var i = 0; i < n; ++i)
            {
                tmp = tmp - list[i].val + b[i];
                if (max < tmp)
                {
                    max = tmp;
                    maxi = i + 1;
                }
            }
            var eat = new char[n];
            for (var i = 0; i < n; ++i) eat[i] = '0';
            for (var i = 0; i < maxi; ++i) eat[list[i].id] = '1';
            ans[u] = string.Concat(eat);
        }
        WriteLine(string.Join("\n", ans));
    }    
}