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

log = lambda *x: print(*x)

def cin(*fn, def_fn=str):
	i,r = 0,[]
	if fn: def_fn=fn[0]
	for c in input().split(' '):
		r+=[(fn[i] if len(fn)>i else def_fn) (c)]
		i+=1
	return r


def q(n):
	c,ln = 0,0
	while n:
		l = n%10
		if ln==0: c = l if l==0 else 1
		elif l!=0: c = 1*(10**ln)+c
		ln += 1
		n //= 10
	return c

def minQ(t):
	a = []
	while t:
		v = q(t)
		a += [v]
		t -= v
	return a


n,=cin(int)
r = minQ(n)

log(len(r))
log(' '.join(str(c) for c in r))

