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.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Scanner;

public class B300 {

	static ArrayList<Integer> all = new ArrayList<Integer>();

	static boolean check(int n) {
		while (n > 0) {
			int d = n % 10;
			if (d != 0 && d != 1)
				return false;
			n /= 10;

		}

		return true;

	}

	static byte dp[][];
	static ArrayList<Integer> ans = new ArrayList<Integer>();

	static short solve(int n, int i) {
		if (n < 0)
			return Byte.MAX_VALUE - 20;

		if (n == 0)
			return 0;

		if (i == 0) {
			if (n == 0)
				return 0;
			else
				return Byte.MAX_VALUE - 20;

		}

		if (dp[n][i] != -1)
			return dp[n][i];

		return dp[n][i] = (byte) Math.min(solve(n - all.get(i), i) + 1,
				solve(n, i - 1));

	}

	static void get(int n, int i) {
		if (n < 0)
			return;

		if (n == 0)
			return;

		if (i == 0) {

			return;

		}

		int c1 = solve(n - all.get(i), i) + 1;
		int c2 = solve(n, i - 1);

		if (c1 <= c2) {
			ans.add(all.get(i));
			get(n - all.get(i), i);

		} else {
			get(n, i - 1);

		}

	}

	public void run() {
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();

		for (int i = 0; i <= n; i++)
			if (check(i))
				all.add(i);

		Collections.sort(all);
		//
		// System.out.println("--" + all.size());
		// for (int i = 0; i < all.size(); i++) {
		// System.out.println(all.get(i));
		// }

		int ii = all.size();
		dp = new byte[n + 3][ii + 3];

		for (int i = 0; i < n + 3; i++)
			for (int j = 0; j < ii + 3; j++)
				dp[i][j] = -1;

		System.out.println(solve(n, ii - 1));
		get(n, ii - 1);

		for (int i = 0; i < ans.size(); i++) {
			System.out.print(ans.get(i) + " ");
		}

		in.close();

	}

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		new B300().run();

	}

}
