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 -*-
"""
Created on Thu May  7 12:29:34 2020

@author: Administrator
"""
l = 1000
n = int(input())
i = 0
qs = [1]
while(1):
    m = qs[i]*10
    p = qs[i]*10+1
    i+=1
    if(m<=l):
        qs.append(m)
    else:
        break
    if(p<=l):
        qs.append(p)
    else:
        break
dp = [0]* (n+1)
prev = [0]*(n+1)

for i in range(1, n+1):
    m = 1000000
    p = 0
    for q in qs:
        if q > i:
            break
        if dp[i-q] <= m:
            m = dp[i-q]
            p = q
    dp[i] = m+1
    prev[i] = p
i = n
print(dp[i])
while(prev[i]):
    print(prev[i],end=" ")
    i = i - prev[i]
            
                
              
    
