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

#eid_mubarak
from sys import stdin, stdout
cin = stdin.readline
cout = stdout.write

def num(n):
	s = str(n)
	t = ''
	for ch in s:
		if ch == '0':
			t += '0'
		else:
			t += '1'
	return int(t)
	
n = int(cin())

ans = []

while n:
	k = num(n)
	n -= k
	ans.append(k)
	#k = n
	#while k:
		
cout(str(len(ans)) + '\n')
for bin in ans:
	cout(str(bin) + ' ')


'''
lst = [11111, 11110, 11101, 11100, 11011, 11010, 11001, 11000, 10111, 10110, 10101, 10100, 10011, 10010, 10001, 10000,
		1111, 1110, 1101, 1100, 1011, 1010, 1001, 1000,
		111, 110, 101, 100,
		11, 10, 1]
i = 0
ans  = []

while i < len(lst) and n:
	k = n//lst[i]
	for j in range(k):
		ans.append(lst[i])
	n -= lst[i] * k
	i += 1

cout(str(len(ans)) + '\n')
for val in ans:
	cout(str(val) + ' ')
#eid_mubarak
'''