#include<stdio.h>
long long int A[200005], B[200005];
long long int h[200005], l;
long long int comp_h(long long int a, long long int b)
{
	if (A[h[a]] > A[h[b]])
		return 1;
	else
		return -1;
}
void swap_h(long long int a, long long int b)
{
	long long int f = h[a];
	h[a] = h[b];
	h[b] = f;
	return;
}
void push(long long int ne)
{
	h[l] = ne;
	long long int p = l++;
	for (; p > 0; p = (p - 1) / 2)
		if (comp_h((p - 1) / 2, p) > 0)
			swap_h((p - 1) / 2, p);
	return;
}
long long int pop()
{
	swap_h(0, --l);
	long long int p = 0;
	for (;;)
	{
		if (2 * p + 2 < l)
		{
			if (comp_h(2 * p + 1, 2 * p + 2) > 0)
			{
				if (comp_h(p, 2 * p + 2) > 0)
					swap_h(p, 2 * p + 2);
				p = 2 * p + 2;
			}
			else
			{
				if (comp_h(p, 2 * p + 1) > 0)
					swap_h(p, 2 * p + 1);
				p = 2 * p + 1;
			}
		}
		else if (2 * p + 1 < l)
		{
			if (comp_h(p, 2 * p + 1) > 0)
				swap_h(p, 2 * p + 1);
			p = 2 * p + 1;
		}
		else
			break;
	}
	return h[l];
}
long long int id[200005];
long long int sum_a[200005], sum_b[200005];
char ans[200005];
void solve()
{
	long long int n;
	scanf("%lld", &n);
	long long int i, j;
	for (i = 0; i < n; i++)
		scanf("%lld", &A[i]);
	for (i = 0; i < n; i++)
		scanf("%lld", &B[i]);
	l = 0;
	for (i = 0; i < n; i++)
		push(i);
	for (i = 0; i < n; i++)
		id[i] = pop();
	sum_a[0] = 0;
	for (i = 0; i < n; i++)
		sum_a[i + 1] = sum_a[i] + A[id[i]];
	sum_b[0] = 0;
	for (i = 0; i < n; i++)
		sum_b[i + 1] = sum_b[i] + B[i];
	for (i = j = 0; i <= n; i++)
		if (sum_b[j] - sum_a[j] < sum_b[i] - sum_a[i])
			j = i;
	for (i = 0; i < n; i++)
		ans[i] = '0';
	ans[n] = '\0';
	for (i = 0; i < j; i++)
		ans[id[i]]++;
	printf("%s\n", ans);
	return;
}
int main()
{
	int t;
	scanf("%d", &t);
	for (; t > 0; t--)
		solve();
	return 0;
}