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

public class QuasiBinary2{
	public static void main(String args[])throws IOException{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int i = Integer.parseInt(br.readLine());
		int ar[][] = new int[9][7];
		int j, cnt = 0, dig;
		while(i!=0){
			dig = i%10;
			for(j = 0; j < dig; j++){
				ar[j][cnt] = 1;
			}
			for(;j<9;j++){
				ar[j][cnt] = 0;
			}
			cnt++;
			i/=10;
		}
		String st;
		int arr[] = new int[9];
		int cnt2 = 0;
		for(i = 0; i < 9; i++){
			st = "";
			for(j = 6; j >=0; j--){
				st+=ar[i][j];
			}
			cnt = Integer.parseInt(st);
			if(cnt!=0)
				arr[cnt2++] = cnt;
		}
		System.out.println(cnt2);
		for(i = 0; i < cnt2; i++)
			System.out.print(arr[i]+" ");
	}//end m
}//end c