#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector<vector<int>> Graph;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define FOR(i,l,r) for (int i = l;i < (int)(r); i++)
#define rep(i,n) for (int i = 0;i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define my_sort(x) sort(x.begin(), x.end())
#define my_max(x) *max_element(all(x))
#define my_min(x) *min_element(all(x))
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<62) - 1;
const int MOD = 998244353;
const int MOD2 = 1e9+7;
const double PI = acos(-1);
vector<int> di = {1,0,-1,0};
vector<int> dj = {0,1,0,-1};

#ifdef LOCAL
#  include <debug_print.hpp>
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif

void solve(){
    int N; cin >> N;
    int M = N * (N + 1) / 2;
    if(M%2){
        cout << -1 << endl;
        return;
    }
    vector dp(N + 1, vector<bool>(M + 1));
    dp[0][0] = true;
    rep(i,N)rep(j,M+1)if(dp[i][j]){
        dp[i + 1][j] = true;
        if(j + i + 1 <= M) dp[i + 1][j + (i + 1)] = true;
    }
    if(!dp[N][M / 2]){
        cout << -1 << endl;
        return;
    }
    else{
        vector<int> ans(M + 1);
        int v = M / 2;
        int idx = N;
        while(idx > 0){
            if(v >= idx && dp[idx - 1][v - idx]){
                ans[idx] = 1;
                v -= idx;
            }
            idx--;
        }
        FOR(i,1,N+1)cout<<ans[i];
        cout << endl;
    }
}

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    int T; cin >> T;
    while(T--) solve();
}