import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = -1-(-1 << 31)
# inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

y = 81181819

def solve():
    def chmin(i, j, val):
        if val < dp[i][j]:
            dp[i][j] = val
            ot[i][j] = m
            clog[i][j] = (c8, c1)

    def toint(a):
        x = 0
        for d in a: x = x*10+d
        return x

    a = y-II()
    aa = [int(c) for c in str(a)]
    n = len(aa)
    # print(aa)
    dp = [[inf]*10 for _ in range(n+1)]
    ot = [[inf]*10 for _ in range(n+1)]
    clog = [[inf]*10 for _ in range(n+1)]
    dp[0][0] = 0
    for i, a in enumerate(aa):
        for m in range(10):
            pre = dp[i][m]
            if pre == inf: continue
            for c8 in range(8):
                for c1 in range(8-c8):
                    nm = m*10+a-c8*8-c1
                    if 0 <= nm < 10:
                        chmin(i+1, nm, max(pre, c8+c1))
        # print(dp[i+1])
    h = dp[-1][0]
    ans = [[0]*n for _ in range(h)]
    m = 0
    for i in range(n, 0, -1):
        c8, c1 = clog[i][m]
        r = 0
        for _ in range(c8):
            ans[r][i-1] = 8
            r += 1
        for _ in range(c1):
            ans[r][i-1] = 1
            r += 1
        m = ot[i][m]
    print(h)
    for a in ans: print(toint(a))

for _ in range(II()): solve()