#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,m,n) for(int i=m; i<n; ++i)
#define repll(i,m,n) for(ll i=m; i<n; ++i)
// #define rep(i,m,n) for(ll i=m; i<n; ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define fir first
#define sec second

template<typename T> bool chmin(T& a, T b){
    if(a > b){a = b; return true;}
    return false;
}
template<typename T> bool chmax(T& a, T b){
    if(a < b){a = b; return true;}
    return false;
}

int main(){
    int T;
    cin >> T;

    while(T--){
        int N;
        cin >> N;

        int S = (N+1)*N/2;
        if(S % 2 == 1){
            cout << -1 << endl;
            continue;
        }

        vector dp(N+1, vector<bool>(S+1, false));
        dp[0][0] = true;
        rep(i, 0, N){
            rep(j, 0, S+1){
                if(!dp[i][j]) continue;
                if(j+i+1 <= S) dp[i+1][j+i+1] = true;
                dp[i+1][j] = dp[i][j];
            }
        }

        if(!dp[N][S/2]){
            cout << -1 << endl;
            continue;
        }
        
        string ans = "";
        int S2 = S / 2;
        for(int i = N; i >= 1; --i){
            if(dp[i-1][S2-i]){
                S2 -= i;
                ans += '1';
            }else if(dp[i-1][S2]){
                ans += '0';
            }
        }
        reverse(all(ans));
        cout << ans << endl;
    }
    return 0;
}