#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

void solve() {
  ll n;
  cin >> n;
  ll s = (n + 1) * n / 2;
  if (s & 1) {
    cout << -1 << endl;
    return;
  }
  vector<bool> ans(n, false);
  ll now = 0;
  ll last = 0;
  rep(i, n) {
    if (now + i + 1 <= s / 2) {
      now += i + 1;
      last = i;
      ans[i] = true;
    } else {
      break;
    }
  }
  for (;; last--) {
    for (ll i = last; i < n - 1 && !ans[i + 1]; i++) {
      if (s / 2 - now == 0) {
        break;
      } else {
        now++;
        ans[i] = false;
        ans[i + 1] = true;
      }
    }
    if (s / 2 - now == 0) {
      break;
    }
  }
  rep(i, n) { cout << (ans[i] ? '1' : '0'); }
  cout << endl;
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  int T = 1;
  cin >> T;
  for (int t = 0; t < T; t++) {
    solve();
  }
  return 0;
}