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

#coding: utf-8

def detOrdem(inteiro):
	res = 0
	ordem = 1
	while inteiro / ordem >= 1:
		res += 1
		ordem *= 10
	return res
		
	


ordem = [
[1],
[10, 11],
[100, 101, 110, 111],
[1000, 1001, 1010, 1100, 1101, 1110, 1111],
[10000, 10001, 10010, 10100, 11000, 11001, 11010, 11100, 11101, 11110, 11111],
[100000, 100001, 100010, 100100, 101000, 110000, 110001, 110010, 110100, 111000, 111001, 111010, 111100, 111101, 111110, 111111]
]

num = int(raw_input())

grandeza = 6
contador = 0
res = []

while num > 0 and grandeza > -1:
	#print num, pow(10, grandeza)
	if num >= pow(10, grandeza) or grandeza == 0:
		i = len(ordem[grandeza]) - 1
		
		while num >= pow(10, grandeza) and i > -1:
			if ordem[grandeza][i] <= num:
				num -= ordem[grandeza][i]
				res.append(ordem[grandeza][i])
				contador += 1
			else:
				i -= 1
	else:
		grandeza -= 1

print contador
for v in res: print v,
