111111
 100009
 10011
 1000000
 8
 10201
 102030
 908172
 123456
 415
 900000
 21
 909090
 314159
 999999
 909823
 987654
 1453
 1435
 98
 10
 2
 1

1
111111
 9
100001 1 1 1 1 1 1 1 1
 1
10011
 1
1000000
 8
1 1 1 1 1 1 1 1
 2
10101 100
 3
101010 1010 10
 9
101111 101011 101010 101010 101010 101010 101010 101000 100000
 6
111111 11111 1111 111 11 1
 5
111 101 101 101 1
 9
100000 100000 100000 100000 100000 100000 100000 100000 100000
 2
11 10
 9
101010 101010 101010 101010 101010 101010 101010 101010 101010
 9
111111 101011 101011 1011 11 1 1 1 1
 9
111111 111111 111111 111111 111111 111111 111111 111111 111111
 9
101111 101111 101101 101100 101100 101100 101100 101100 101000
 9
111111 111111 111111 111111 111110 111100 111000 110000 100000
 5
1111 111 111 110 10
 5
1111 111 111 101 1
 9
11 11 11 11 11 11 11 11 10
 1
10
 2
1 1
 1
1

'''input
32
'''
#538B
s = input()
n = len(s)
temp = [int(i) for i in s]
ans = ['' for i in range(9)]
for i in temp:
	for j in range(9):
		ans[j] += '01'[i>j]
# print(ans)
ans = [i for i in map(int,ans) if i]
print(len(ans))
print(*ans)

quit()
#698A
# import numpy as np #cant import numpy on codeforces
from sys import stdin,stdout
read = lambda: map(int,stdin.readline().split())
I = lambda: stdin.readline()

n = int(I())
arr = tuple(read())
memo = {}
poss = [[0],[0,1],[0,2],[0,1,2]]
dp = [[10**6 for i in range(3)] for i in range(n+1)]
dp[n] = [0,0,0]
# print(dp)
for i in range(n-1,-1,-1):
	for last in range(3):
		for p in poss[arr[i]]:
			# print(last,p,1 if ((last and p) or p==0) else 0)
			dp[i][last] = min(dp[i][last],(1 if ((last & p) or p==0) else 0) + dp[i+1][p])
print(dp[0][0])
# print(dp)
