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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskB solver = new TaskB();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskB {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt();
            int i = 1;
            ArrayList<Integer> al = new ArrayList<>();
            while (true) {
                int temp = Integer.parseInt(Integer.toBinaryString(i));
                if (temp > (int) 1e6)
                    break;
                al.add(temp);
                i++;
            }
            Integer[] arr = new Integer[al.size()];
            arr = al.toArray(arr);
            int len = arr.length;
            int[][] dp = new int[len][n + 1];
            for (int j = 0; j < len; j++)
                dp[j][0] = 0;
            for (int j = 1; j <= n; j++)
                dp[0][j] = j;
            for (i = 1; i < len; i++) {
                for (int j = 1; j <= n; j++) {
                    dp[i][j] = dp[i - 1][j];
                    if (arr[i] <= j)
                        dp[i][j] = Math.min(dp[i][j], 1 + dp[i][j - arr[i]]);
                }
            }
            out.println(dp[len - 1][n]);
            int column = n;
            int row = len - 1;
            while (column > 0) {
                if (row == 0) {
                    while (column-- > 0)
                        out.print(1 + " ");
                } else if (dp[row][column] == dp[row - 1][column])
                    row -= 1;
                else {
                    out.print(arr[row] + " ");
                    column -= arr[row];
                }
                //out.println(row+" "+column);
            }
            out.println();

        }

    }

    static class InputReader {
        BufferedReader br;
        StringTokenizer st;

        public InputReader(InputStream inputStream) {
            br = new BufferedReader(new InputStreamReader(inputStream));
        }

        public String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    throw new RuntimeException();
                }
            }
            return st.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
}

