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.util.Arrays;

public class LaLiLoLiLu {

	public static void main(String[] args) throws NumberFormatException,
			IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int n = Integer.parseInt(br.readLine());
		int[] d = new int[7];
		Arrays.fill(d, 0);
		int i = 0;
		while (n != 0) {
			d[i++] = n % 10;
			n = n / 10;
		}
		String r="";
		int c=0;
		while(empty(d)){
			int sum = 0;
			int pow = 1;
		for (int j = 0; j < 7; j++) {
			if (d[j] > 0) {
				d[j]--;
				sum += 1 * pow;
			}
			pow*=10;
		}
		c++;
		r+=sum+" ";
		}
		if(r.equals("")){
			r+=0;
			c++;
			}
		System.out.println(c);
		System.out.println(r);
	}
	static boolean empty(int []d){
		for(int i=0;i<d.length;i++)
			if(d[i]!=0)
				return true;
		return false;
	}
}
