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;

/**
 * Created by Hoang Anh Pham on 05/10/2017.
 */
public class CodeForce_538B {
    static int mu(int a, int b) {
        if (b == 0) return 1;
        else return a*mu(a,b-1);
    }
    public static void main(String[] args) {
        int n;
        int k = 0;
        Scanner sc = new Scanner(System.in);
        n = sc.nextInt( );
        sc.close();
        int a[ ] = new int [10];
        int maxi = 0;
        int num = 0;
        while (n > 0){
            int x = (n%10);
            if (x > maxi) {
                maxi = x;
            }
            for (int i = 0; i < x; i++){
                if (a[i] == 0) a[i] = mu(10, num+1)/10;
                else a[i] = (a[i]  + mu(10, num));
            }
            n = n/10;
            num++;
        }
        System.out.println(maxi);
        for (int i = 0; i < maxi; i++){
            System.out.print(a[i] + " ");
        }



    }
}
