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.IOException;

import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;

public class Main {
	public static void main(String args[]) throws IOException {

		ArrayList<Integer> list = new ArrayList<>();

		int output = 10;
		list.add(1);

		while (output != 10000000) {
			list.add(output);
			for (int i = list.size() - 2; i >= 0; i--)
				list.add(output + list.get(i));
			output *= 10;

		}
		Collections.sort(list, Collections.reverseOrder());


		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		ArrayList<Integer> outputList = new ArrayList<>();
		while (n != 0) {
			for (int i : list) {
				if (i <= n && n != 0) {
					outputList.add(i);
					n = n - i;
					break;
				}

			}

		}
		System.out.println(outputList.size());
		for(Integer i:outputList)
			System.out.print(i+" ");
	}

}