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 B {
	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(System.in);
		int[] nums = new int[] { 1, 10, 11, 100, 101, 110, 111, 1000, 1001,
				1010, 1011, 1100, 1101, 1110, 1111, 10000, 10001, 10010, 10011,
				10100, 10101, 10110, 10111, 11000, 11001, 11010, 11011, 11100,
				11101, 11110, 11111, 100000, 100001, 100010, 100011, 100100,
				100101, 100110, 100111, 101000, 101001, 101010, 101011, 101100,
				101101, 101110, 101111, 110000, 110001, 110010, 110011, 110100,
				110101, 110110, 110111, 111000, 111001, 111010, 111011, 111100,
				111101, 111110, 111111, 1000000, 1000001, 1000010, 1000011,
				1000100, 1000101, 1000110, 1000111, 1001000, 1001001, 1001010,
				1001011, 1001100, 1001101, 1001110, 1001111, 1010000, 1010001,
				1010010, 1010011, 1010100, 1010101, 1010110, 1010111, 1011000,
				1011001, 1011010, 1011011, 1011100, 1011101, 1011110, 1011111,
				1100000, 1100001, 1100010, 1100011, 1100100, 1100101, 1100110,
				1100111, 1101000, 1101001, 1101010, 1101011, 1101100, 1101101,
				1101110, 1101111, 1110000, 1110001, 1110010, 1110011, 1110100,
				1110101, 1110110, 1110111, 1111000, 1111001, 1111010, 1111011,
				1111100, 1111101, 1111110, 1111111, 10000000, 10000001,
				10000010, 10000011, 10000100, 10000101, 10000110, 10000111,
				10001000, 10001001, 10001010, 10001011, 10001100, 10001101,
				10001110, 10001111, 10010000, 10010001, 10010010, 10010011,
				10010100, 10010101, 10010110, 10010111, 10011000, 10011001,
				10011010, 10011011, 10011100, 10011101, 10011110, 10011111,
				10100000, 10100001, 10100010, 10100011, 10100100, 10100101,
				10100110, 10100111, 10101000, 10101001, 10101010, 10101011,
				10101100, 10101101, 10101110, 10101111, 10110000, 10110001,
				10110010, 10110011, 10110100, 10110101, 10110110, 10110111,
				10111000, 10111001, 10111010, 10111011, 10111100, 10111101,
				10111110, 10111111, 11000000, 11000001, 11000010, 11000011,
				11000100, 11000101, 11000110, 11000111, 11001000, 11001001,
				11001010, 11001011, 11001100, 11001101, 11001110, 11001111,
				11010000, 11010001, 11010010, 11010011, 11010100, 11010101,
				11010110, 11010111, 11011000, 11011001, 11011010, 11011011,
				11011100, 11011101, 11011110, 11011111, 11100000, 11100001,
				11100010, 11100011, 11100100, 11100101, 11100110, 11100111,
				11101000, 11101001, 11101010, 11101011, 11101100, 11101101,
				11101110, 11101111, 11110000, 11110001, 11110010, 11110011,
				11110100, 11110101, 11110110, 11110111, 11111000, 11111001,
				11111010, 11111011, 11111100, 11111101, 11111110, 11111111 };

		ArrayList<Integer> search = new ArrayList<>();
		for (int i : nums)
			search.add(i);
		Collections.sort(search);
		int n = sc.nextInt();
		if (n == 0) {
			System.out.println("1\n0");
			System.exit(0);
		}
		ArrayList<Integer> ans = new ArrayList<Integer>();
		for (int i = search.size() - 1; i >= 0; i--) {
			while (n >= search.get(i)) {
				n -= search.get(i);
				ans.add(search.get(i));
			}
		}

		System.out.println(ans.size());
		for (int i : ans)
			System.out.print(i + " ");
	}
}
