#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

using namespace std;

typedef long long ll;
#define all(x) begin(x), end(x)
constexpr int INF = (1 << 30) - 1;
constexpr long long IINF = (1LL << 60) - 1;
constexpr int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

template <class T> istream& operator>>(istream& is, vector<T>& v) {
    for (auto& x : v) is >> x;
    return is;
}

template <class T> ostream& operator<<(ostream& os, const vector<T>& v) {
    auto sep = "";
    for (const auto& x : v) os << exchange(sep, " ") << x;
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) { return y < x and (x = forward<U>(y), true); }

template <class T, class U = T> bool chmax(T& x, U&& y) { return x < y and (x = forward<U>(y), true); }

template <class T> void mkuni(vector<T>& v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <class T> int lwb(const vector<T>& v, const T& x) { return lower_bound(begin(v), end(v), x) - begin(v); }

void solve() {
    int N;
    cin >> N;
    int sum = N * (N + 1) / 2;
    if (sum & 1) {
        cout << -1 << '\n';
        return;
    }

    sum /= 2;
    vector dp(N + 1, vector<int>(sum + 1, -1));
    dp[0][0] = 0;
    for (int i = 0; i < N; i++) {
        for (int j = 0; j <= sum; j++) {
            if (dp[i][j] == -1) continue;
            dp[i + 1][j] = j;
            if (j + (i + 1) <= sum) dp[i + 1][j + (i + 1)] = j;
        }
    }

    if (dp[N][sum] == -1) {
        cout << -1 << '\n';
        return;
    }
    string ans = "";
    for (int i = N, j = sum; i > 0; i--) {
        int nj = dp[i][j];
        ans += (nj < j ? '1' : '0');
        j = nj;
    }
    reverse(all(ans));
    cout << ans << '\n';
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T;
    cin >> T;
    for (; T--;) solve();
    return 0;
}