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

public class Codeforces {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
//		 SNumber n = new SNumber(in.next());
		int n = in.nextInt();
		byte[] ans = new byte[9];
		int max = 0;
		int t;
		for(int i = 1; n > 0; i*= 10){
			t = n % 10;
			n /= 10;
			if(t > max){
				max = t;
			}
			for(int j = 0; j < t; j++){
				ans[j] += i;
			}
		}
		System.out.println(max);
		for(int i = max - 1; i >= 0; i--){
			System.out.print(ans[i]+ " ");
		}
	}

}

class SNumber {
	byte[] num;

	public SNumber(String s) {
		num = new byte[s.length()];
		for (int i = 0; i < s.length(); i++) {
			num[i] = (byte) (s.charAt(i) - '0');
		}
	}
}
