#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vii = vector<vector<int>>;
using vll = vector<vector<ll>>;
#define ALL(x) (x).begin(), (x).end()
#define coutY cout << "Yes" << endl;
#define coutN cout << "No" << endl;
#define arrIn(arr, start, N) for (ll i = (start); i < (N); ++i) cin >> arr[i];
#define arrOut(arr, start, N) for  (ll i = (start); i < (N); ++i) { cout << arr[i] <<" "; } cout << endl;
#define mod9 998244353
#define mod1 1000000007
void yn(bool tf) { cout << (tf ? "Yes\n" : "No\n"); }
void YN(bool tf) { cout << (tf ? "YES\n" : "NO\n"); }
string ABC="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
string abc="abcdefghijklmnopqrstuvwxyz";

//cout << fixed << setprecision(20) <<

bool kaibun(string S){
  string T=S;
  reverse(ALL(S));
  return S==T;
}

auto start = high_resolution_clock::now();

bool CheckTime(auto limit,auto eps){
  auto end = high_resolution_clock::now();
  return  duration_cast<milliseconds>(end - start).count()<limit-eps;
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  ll T;
  cin >> T;
  for(ll t=0;t<T;t++){
    ll N;
    cin >> N;
    vector<pair<ll,ll>> A(N+1,make_pair(0,0));
    vl B(N+1,0);
    for(ll i=1;i<=N;i++){
      cin >> A[i].first;
      A[i].second=i;
    }
    arrIn(B,1,N+1);
    sort(ALL(A));
    
    vl ruiseki(N+1,0);
    ll max=0;
    ll index=0;
    for(ll i=1;i<=N;i++){
      ruiseki[i]=ruiseki[i-1]+A[i].first;
      B[i]+=B[i-1];
      if(max<B[i]-ruiseki[i]){
        max=B[i]-ruiseki[i];
        index=i;
      }
    }
    string S;
    for(ll i=0;i<N;i++){
      S+='0';
    }
    
    for(ll i=1;i<=index;i++){
      S[A[i].second-1]='1';
    }
    
    cout << S << endl;
  }
 
  return 0;
}