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.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
import java.util.Arrays;

public class QuasiBinary {

    static StreamTokenizer st;
    static PrintWriter out;
    static int[] qb;
    static int[] sol;
    static int[] dp;
    static int[] sib;

    public static void main(String[] args) throws IOException {
        st = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
        out = new PrintWriter(new BufferedOutputStream(System.out), false);
        genAll();
        sol = new int[64];
        dp = new int[1000001];
        sib = new int[1000001];

        int n = nextInt();
        out.println(solve(n));
        printsol(n);
        out.flush();
    }

    static int solve(int x) {
        if (x == 0) {
            return 0;
        }
        if (dp[x] != 0) {
            return dp[x];
        }
        int big = Arrays.binarySearch(qb, x);
        if (big >= 0) {
            return dp[x] = 1;
        } else {
            big *= -1;
            big -= 2;
            int min = 1000005;
            while (big >= 0) {
                int sol = 1 + solve(x - qb[big]);
                if (min > sol) {
                    sib[x] = x - qb[big];
                    min = sol;
                }
                big--;
            }
            return dp[x] = min;
        }
    }

    static int nextInt() throws IOException {
        st.nextToken();
        return (int) st.nval;
    }

    static void genAll() {
        qb = new int[64];
        int mask = 1;
        int i = 0;
        int v = 0;
        while ((v = parseMask(mask++)) <= 1000000) {
            qb[i++] = v;
        }
    }

    static int parseMask(int mask) {
        int i = 0;
        int p = 1;
        int res = 0;
        while (mask != 0) {
            int b = 1 << i;
            if ((mask & b) != 0) {
                mask ^= b;
                res += p;
            }
            i++;
            p *= 10;
        }
        return res;
    }

    private static void printsol(int n) {
        int i = 0;
        while ((n - sib[n]) != 0) {
            if (i != 0) {
                out.print(" ");
            }
            out.print((n - sib[n]));
            i++;
            n = sib[n];
        }
        out.println();
    }
}
