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

# QUASI BINARY
# Estacio Pereira, estacio.neto@ccc.ufcg.edu.br
# UFCG

# INPUT
n = raw_input()
x = int(n)
# PROCESS
if len(n) == 1:
	print n
	for i in range(int(n) - 1):
		print 1,
	print 1
else:
	numeros = []
	lista = []
	num = "1"
	num0 = "1"
	for i in range(len(n)):
		lista.append(num0)
		lista.append(num)
		num += "1"
		num0 += "0"
	while x:
		for i in range(-1, -(len(lista) + 1), -1):
			if x / int(lista[i]) != 0:
				a = int(lista[i])
				x -= a
				numeros.append(a)
				break

# OUTPUT
	print len(numeros)
	for e in numeros:
		print e,

