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.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.StringTokenizer;
import java.util.stream.IntStream;

public class Main{
    private static BufferedReader br;
    private static StringTokenizer st;

    public static void main(String[] args) {
        br = new BufferedReader(new InputStreamReader(System.in));
        st = new StringTokenizer("");
        ArrayList<Integer> qBinaryNumbers = new ArrayList<>();
        int n = Integer.parseInt(next());

        int dp[] = new int[n+1];
        int dpIndex[] = new int[n+1];

        for(int i = 1; i < 1e6+1; i++) {
            if(quasi(i)) qBinaryNumbers.add(i);
        }

        for(int i = 1; i <= n; i++) {
            if(quasi(i)) dp[i] = 1;
            else {
                int min = 100_000_000;
                int ind = 0;
                while(ind < qBinaryNumbers.size() && qBinaryNumbers.get(ind) <= i) {
                    int current = qBinaryNumbers.get(ind);
                    if(1+dp[i-current] < min) {
                        min = 1+dp[i-current];
                        dpIndex[i] = current;
                    }
                    ind++;
                }
                dp[i] = min;
            }
        }

        StringBuilder sb = new StringBuilder("");
        int ind = n;
        while(dpIndex[ind] != 0) {
            sb.append(dpIndex[ind]+" ");
            ind-=dpIndex[ind];
        }
        sb.append(ind);
        System.out.println(dp[n]);
        System.out.println(sb.toString());
    }

    private static boolean quasi(int n) {
        while(n > 0) {
            int k = n%10;
            if(k != 0 && k != 1)
                return false;
            n/=10;
        }
        return true;
    }

    public static String next() {
        if(st.hasMoreTokens()) {
            return st.nextToken();
        } else {
            try {
                st = new StringTokenizer(br.readLine());
            } catch(IOException e) {
                e.printStackTrace();
            }
        }
        return st.nextToken();
    }
}