#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int t; cin >> t;
	while (t--) {
		int n; cin >> n;
		vector<P>a(n);
		vector<int>b(n);
		rep(i, n)cin >> a[i].first, a[i].second = i;
		rep(i, n)cin >> b[i];
		sort(allR(a));
		vector<long long>sb(n + 1);
		rep(i, n)sb[i + 1] = sb[i] + b[i];
		long long mx = -LINF;
		int idx = -1;
		long long sum = 0;
		rep(i, n + 1) {
			long long val = sum;
			// a->i
			// b->n-i
			val += sb[n - i] - sb[0];
			//cout << i << "->" << val << endl;
			if (chmax(mx, val))idx = i;
			if (i != n)sum += a[i].first;
		}
		//cout << idx << " " << mx << endl;
		vector<int>ans(n, 1);
		rep(i, idx)ans[a[i].second] = 0;
		rep(i, n)cout << ans[i];
		cout << endl;
	}
	return 0;
}