D.cpp

#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;

#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define per(i, a, b) for (auto i = (b); i-- > (a); )
#define eb(x...) emplace_back(x)
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) int((x).size())
#define lb(x...) lower_bound(x)
#define ub(x...) upper_bound(x)

template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

const int N = 1 << 11;
bool fin[N];
ll E[N];

void solve() {
	ll k; cin >> k;
	if (k & 1) return void(cout << "-1\n");
	int n = 1;
	fill(fin, fin + N, 0);
	fin[1] = 1;
	while (k) {
		ll sz = 1; int r = 0;
		while (2 * (sz - 1) <= k) sz <<= 1, ++r;
		sz >>= 1; --r;
		k -= 2 * (sz - 1);
		n += r;
		fin[n] = 1;
	}
	cout << n - 1 << '\n';
	rep(i, 1, n) cout << fin[i] << ' ';
	cout << '\n';
}

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

	int t; cin >> t;
	while (t--) solve();
}