#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60LL;
const int IINF = (1 << 30) - 1;


pair<int, bool> dp[101][10001];

void solve(){
    int n; cin >> n;
    vector<bool> check(n+1, false);
    int sum = n*(n+1)/2;
    if(sum%2==1){
        cout << -1 << '\n';
        return;
    }

    sum /= 2;
    if(!dp[n][sum].second){
        cout << -1 << '\n';
        return ;
    }

    int now = sum;
    for(int i=n; i>=1; i--){
        if(dp[i][now].first!=now){
            check[now-dp[i][now].first]=true;
            now = dp[i][now].first;
        }
    }

    for(int i=1; i<=n; i++){
        cout << check[i];
    }
    cout << '\n';
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    dp[0][0] = {-1, true};
    for(int i=1; i<=100; i++){
        for(int j=0; j<=10000; j++){
            if(dp[i-1][j].second){
                dp[i][j] = {j, true};
            }
            if(!dp[i][j].second && j-i>=0){
                if(dp[i-1][j-i].second){
                    dp[i][j] = {j-i, true};
                }
            }
        }
    }
    
    int T=1;
    cin >> T;
    while(T--) solve();
}