def main():
    T = int(input())
    for _ in range(T):
        N = int(input())
        print(solve(N))


def solve(N):
    def tri(x):
        return x * (x + 1) // 2

    T = tri(N)
    if T & 1:
        return -1

    T = T // 2

    dp = [[(-1, -1)] * (T + 1) for _ in range(N + 1)]

    dp[0][0] = (0, -1)

    for i in range(1, N + 1):
        for j in range(T + 1):
            if dp[i - 1][j] != (-1, -1):
                dp[i][j] = dp[i - 1][j]
                continue
            if j - i >= 0:
                if dp[i - 1][j - i] != (-1, -1):
                    dp[i][j] = (i, dp[i - 1][j - i][0])

    if dp[N][T] == (-1, -1):
        return -1

    v, p = dp[N][T]
    res = [v]
    S = T
    while p != 0:
        S -= v
        v, p = dp[p][S]
        res.append(v)

    ans = [0] * (N + 1)
    for v in res[::-1]:
        ans[v] = 1

    return "".join(map(str, ans[1:]))


if __name__ == "__main__":
    main()