#include <bits/stdc++.h>
using namespace std;
template <class T>
vector<T> iarr(int n) {
  vector<T> a;
  while (n--) {
    T _v;
    cin >> _v, a.push_back(_v);
  }
  return a;
}
template <class T>
vector<vector<T>> imat(int n, int m) {
  vector<vector<T>> ma(n, vector<T>(m));
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++) cin >> ma[i][j];
  return ma;
}
void solve();
int main() {
  ios_base::sync_with_stdio(false);
  cout.tie(0);
  cin.tie(0);
  int tt;
  cin >> tt;
  for (; tt-- > 0;) solve();
  return 0;
}
class BIT {
 public:
  BIT(int n = 0) { a = vector<int>(n + 1, 0); }
  int get(int i) {
    int s = 0;
    for (; i > 0; i -= i & -i) s += a[i];
    return s;
  }
  void set(int i, int v) {
    for (; i < a.size(); i += i & -i) a[i] += v;
  }
  vector<int> a;
};
void solve() {
  int n;
  cin >> n;
  auto a = iarr<int>(n);
  int j = -1;
  int v = 2;
  BIT b(n);
  for (int i = 0; i < n; i++) {
    if (a[i] == 1) {
      j = i;
      break;
    }
  }
  int l = j - 1, r = j + 1;
  b.set(1, 1);
  cout << 1;
  while (l >= 0 || r < n) {
    int ll = l >= 0 ? a[l] : 10000000;
    int rr = r < n ? a[r] : 10000000;
    if (ll < rr) {
      b.set(ll, 1);
      l--;
    } else {
      b.set(rr, 1);
      r++;
    }
    if (b.get(v) == v) {
      cout << 1;
    } else {
      cout << 0;
    }
    v++;
  }
  cout << "\n";
}
