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

import java.io.*;
import java.util.*;

public class Solution {
    static Long time = System.currentTimeMillis();
    static Vector<Integer> v = new Vector<>();
    private static int[][] ar;
    static Map<Integer, Integer> mp = new HashMap<>();
    public static void main(String[] args) throws IOException {
//        System.setIn(new FileInputStream("input.txt"));
//        System.setOut(new PrintStream(new FileOutputStream("output.txt")));
        Scanner sc = new Scanner( System.in );
        int n = 314159;
        for ( int i = 1; i <= n; i++ ) {
            boolean f = true;
            int t = i;
            while ( t != 0 ) {
                f = f && t%10 < 2;
                t/=10;
            }
            if ( f ) {
                v.add( i );
            }
        }
        Collections.reverse( v );
        ar = new int[n+1][v.size()];
        int ans = getAns(0, n);
        System.out.println(ans);
        while ( n != 0 ) {
            if ( mp.get( n ) == null ) {
                System.out.println(n);
                break;
            }
            System.out.println(mp.get( n ));
            n -= mp.get( n );
        }
        System.out.printf("time = %d\n", System.currentTimeMillis()-time);
    }

    private static int getAns( int i, int n ) {
        if ( n<0 || i==v.size() ) return 1324323545;
        if ( v.get( i )==n ) return 1;
        if ( ar[n][i]!=0 ) return ar[n][i];
        int x = 1 + getAns( i, n-v.get( i ) );
        int y = getAns( i+1, n );
        if ( x<y ){
            mp.put( n, v.get( i ) );
            ar[n][i] = x;
            return x;
        }
        else {
            ar[n][i] = y;
            return y;
        }
    }
}