#![allow(non_snake_case, unused_imports, unused_must_use)] use std::io::{self, prelude::*, BufWriter, StdinLock, StdoutLock}; use std::str; fn main() { let (stdin, stdout) = (io::stdin(), io::stdout()); let mut scan = Scanner::new(stdin.lock()); let mut out = io::BufWriter::new(stdout.lock()); macro_rules! input { ($T: ty) => { scan.token::<$T>() }; ($T: ty, $N: expr) => { (0..$N).map(|_| scan.token::<$T>()).collect::>() }; } let t = input!(usize); for _ in 0..t { solve(&mut scan, &mut out); } } fn solve(scan: &mut Scanner, out: &mut BufWriter) { macro_rules! input { ($T: ty) => { scan.token::<$T>() }; ($T: ty, $N: expr) => { (0..$N).map(|_| scan.token::<$T>()).collect::>() }; } let N = input!(usize); let mut dp = vec![vec![false; (N * (N + 1) / 2) + 1]; N + 1]; dp[0][0] = true; for i in 0..N { let d = i + 1; for j in 0..=(N * (N + 1)) / 2 { if dp[i][j] && j + d <= (N * (N + 1)) / 2 { dp[i + 1][j + d] = true; } if dp[i][j] { dp[i + 1][j] = true; } } } let s = N * (N + 1) / 2; if s % 2 == 0 { let mut ans = vec![false; N + 1]; let mut now = s / 2; for i in (1..=N).rev() { if now >= i && dp[i][now] && dp[i - 1][now - i] { now -= i; ans[i] = true; } } ans.remove(0); if now == 0 { writeln!( out, "{}", ans.iter() .map(|&x| if x { "1" } else { "0" }) .collect::>() .join("") ); } else { writeln!(out, "-1"); } } else { writeln!(out, "-1"); } } struct Scanner { reader: R, buf_str: Vec, buf_iter: str::SplitWhitespace<'static>, } impl Scanner { fn new(reader: R) -> Self { Self { reader, buf_str: vec![], buf_iter: "".split_whitespace(), } } fn token(&mut self) -> T { loop { if let Some(token) = self.buf_iter.next() { return token.parse().ok().expect("Failed parse"); } self.buf_str.clear(); self.reader .read_until(b'\n', &mut self.buf_str) .expect("Failed read"); self.buf_iter = unsafe { let slice = str::from_utf8_unchecked(&self.buf_str); std::mem::transmute(slice.split_whitespace()) } } } }