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.*;

public class Test {


    static Scanner sc = new Scanner(System.in);

    static  boolean binSearch(int[] arr, int key) {
        int max = arr.length - 1;
        int min = 0;
        int mid;
        while (min <= max) {
            mid = (max + min) / 2;
            if (key > arr[mid] ) {
                min = mid  + 1;
            }
            else if (key == arr[mid])
                return true;
            else if(key < arr[mid]) {
                max = mid - 1;
            }
        }
        return false;
    }

    static int partition(int arr[], int left, int right)
    {
        int i = left, j = right;
        int tmp;
        int pivot = arr[(left + right) / 2];

        while (i <= j) {
            while (arr[i] < pivot)
                i++;
            while (arr[j] > pivot)
                j--;
            if (i <= j) {
                tmp = arr[i];
                arr[i] = arr[j];
                arr[j] = tmp;
                i++;
                j--;
            }
        }

        return i;
    }

    static int[] quickSort(int arr[], int left, int right) {
        int index = partition(arr, left, right);
        if (left < index - 1)
            quickSort(arr, left, index - 1);
        if (index < right)
            quickSort(arr, index, right);

        return arr;
    }

    static int[] nextInts(int n) {
        int[] arr = new int[n];
        for (int i = 0; i < n; i++) {
            arr[i] = sc.nextInt();
        }
        return arr;
    }

    static boolean normalSearch(int[] arr, int key) {
        for (int i = 0; i < arr.length; i++) {
            if (arr[i] == key)
                return true;
        }
        return false;
    }

    static int findMin(int[] a) {
        int min = 999;
        for (int i = 0; i < a.length; i++) {
            if (a[i] < min && a[i] != 0)
                min = a[i];
        }

        return min;
    }

    public static void main(String[] args) {

        char[] str = sc.nextLine().toCharArray();

        int[] num = new int[str.length];

        for (int i = 0; i < num.length; i++) {
            num[i] = str[i]-'0';
        }


        int sol = 0;

        int[] mins = new int[num.length+1];
        String[] temp = new String[num.length];

        for (int i = 0; i < num.length; i++) {
            int min = findMin(num);

            if (min == 999) break;

            sol += min;
            mins[i] = min;

            temp[i] = "";
            boolean started = false;
            for (int j = 0; j < num.length; j++) {
                if (num[j] >= min) {
                    num[j] -= min;
                    temp[i] += "1";
                    started = true;
                }
                else if (started)
                    temp[i] += "0";
            }

        }

        System.out.println(sol);

        for (int i = 0; mins[i] > 0; i++) {
            for (int j = 0; j < mins[i]; j++) {
                System.out.printf("%s ", temp[i]);
            }
        }




    }

}
