// (⁠◕⁠ᴗ⁠◕⁠✿⁠) // #pragma GCC target("avx2") // #pragma GCC optimize("O3") // #pragma GCC optimize("unroll-loops") #include #define rep(i, n) for (ll i = 0; i < (n); i++) #define srep(i, s, n) for (ll i = s; i < (n); i++) #define len(x) ((int)(x).size()) #define all(x) (x).begin(), (x).end() using namespace std; template using vc = vector; template using vv = vc>; template using vvv = vv>; using vi = vc;using vvi = vv; using vvvi = vv; using ll = long long;using vl = vc;using vvl = vv; using vvvl = vv; using ld = long double; using vld = vc; using vvld = vc; using vvvld = vc; using uint = unsigned int; using ull = unsigned long long; const ld pi = 3.141592653589793; const int inf = 0x3f3f3f3f; const ll INF = 0x3f3f3f3f3f3f3f3f; // const ll mod = 1000000007; const ll mod = 998244353; inline bool inside(ll y, ll x, ll H, ll W) {return 0 <= (y) and (y) < (H) and 0 <= (x) and (x) < (W); } #define debug(var) do{std::cout << #var << " : \n";view(var);}while(0) template void view(T e){cout << e << endl;} template void view(const vc& v){for(const auto& e : v){ cout << e << " "; } cout << endl;} template void view(const vv& vv){ for(const auto& v : vv){ view(v); } } int main(){ int M = 100; vvi dp(M + 1, vi (M * (M + 1) / 2 + 1, 0)); dp[0][0] = 1; srep(i, 1, M + 1) rep(j, i * (i + 1) / 2 + 1){ if (dp[i - 1][j]) dp[i][j] = 1; if (j - i >= 0 && dp[i - 1][j - i]) dp[i][j] = 1; } int T; cin >> T; vc ret; while (T--){ int N; cin >> N; if (N * (N + 1) % 4 || dp[N][N * (N + 1) / 4] == 0) ret.push_back("-1"); else{ string ans = ""; int nw = N * (N + 1) / 4; for (int i = N; i > 0; i--){ if (dp[i - 1][nw]) ans += '0'; else{ ans += '1'; nw -= i; } } reverse(all(ans)); ret.push_back(ans); } } for (auto x : ret) cout << x << endl; }