#include <bits/stdc++.h>

void solve() {
    const int S = 6000;
    const int N = 100;
    std::vector dp(S, std::vector<bool>(S));
    dp[0][0] = true;
    int sum = 0;
    for (int i = 1; i <= N; i++) {
        for (int j = 0; j <= sum; j++) {
            int k = sum - j;
            dp[j + i][k] = true;
            dp[j][k + i] = true;
        }
        sum += i;
    }

    auto test = [&](const std::vector<int>& res) {
        int n = res.size();
        int lhs = 0;
        int rhs = 0;
        for (int i = 0; i < n; i++) {
            if (res[i]) {
                lhs += i + 1;
            } else {
                rhs += i + 1;
            }
        }
    };

    int t;
    std::cin >> t;
    while (t--) {
        int n;
        std::cin >> n;
        int sum = n * (n + 1) / 2;
        if (sum % 2 != 0 || !dp[sum / 2][sum / 2]) {
            std::cout << -1 << '\n';
        } else {
            std::vector<int> ans;
            int lhs = sum / 2;
            int rhs = sum / 2;
            for (int i = n; i > 0; i--) {
                if (lhs - i >= 0 && dp[lhs - i][rhs]) {
                    lhs -= i;
                    ans.push_back(0);
                } else {
                    rhs -= i;
                    ans.push_back(1);
                }
            }
            std::ranges::reverse(ans);
            for (auto v: ans) {
                std::cout << v;
            }
            std::cout << '\n';
            test(ans);
        }
    }
}

int main() {
    std::cin.tie(0)->sync_with_stdio(0);
    std::cout << std::fixed << std::setprecision(16);
    int t = 1;

    while (t--) solve();
}