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.util.Scanner;

public class ACMSubmit {
    
    public static void main(String[] args) {
        quasiBinary();
    }
    
    public static void quasiBinary(){
        String in = scanner.nextLine();
        
        int maxDigit = 1;
        int[] n = new int[in.length()];
        for (int i = 0; i < in.length(); i++){
            n[i] = in.charAt(i) - '0';
            if (n[i] > maxDigit) maxDigit = n[i];
        }
        
        int[][] outArray = new int[maxDigit][n.length];
        
        for (int col = 0; col < n.length; col++)
            for (int row = 0; row < n[col]; row++)
                outArray[row][col] = (int)Math.pow(10, n.length-col-1);
            
        String out = "";
        for (int row = 0; row < outArray.length; row++){
            int num = 0;
            for (int i : outArray[row]) num += i;
            out += num + " ";
        }
        
        System.out.println(maxDigit);
        System.out.println(out.trim());
    }
     
    static Scanner scanner = new Scanner(System.in);
}