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.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;

public class Problem538B {
	public static void main(String[] args) {
		InputReader in = new InputReader();
		PrintWriter out = new PrintWriter(System.out);

		new Problem538B().solve(in, out);

		out.close();
	}

	public void solve(InputReader in, PrintWriter out) {
		int n = in.nextInt();

		List<Integer> list = generateAll();

		int[] dp = new int[n + 1];
		int[] parent = new int[n + 1];
		for (int i = 1; i <= n; i++) {

			for (int j = 0; j < list.size(); j++) {
				if (i - list.get(j) >= 0) {

					if (dp[i] > 0) {
						if (dp[i - list.get(j)] + 1 < dp[i]) {
							dp[i] = dp[i - list.get(j)] + 1;
							parent[i] = list.get(j);
						}
					} else {
						dp[i] = dp[i - list.get(j)] + 1;
						parent[i] = list.get(j);
					}
				}
			}
		}

		out.println(dp[n]);
		
		while(n > 0) {
			out.print(parent[n] + " ");
		
			n -= parent[n];
		}
	}

	private static List<Integer> generateAll() {
		List<Integer> list = new ArrayList<Integer>();

		for (int i = 1; i <= 64; i++) {
			String b = Integer.toBinaryString(i);

			int n = 0;
			int pow = 1;
			for (int j = b.length() - 1; j >= 0; j--) {
				n += (b.charAt(j) - '0') * pow;
				pow *= 10;
			}

			list.add(n);
		}

		return list;
	}

	static class InputReader {
		public BufferedReader br;
		public StringTokenizer st;

		public InputReader() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}

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

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

		long nextLong() {
			return Long.parseLong(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			String str = "";
			try {
				str = br.readLine();
			} catch (IOException e) {
				e.printStackTrace();
			}
			return str;
		}
	}
}
