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.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.PriorityQueue;

public class Main {
	static int[] quasi ;
	static boolean[][] counter;
	static int[] memo = new int[1000000+10];
	static boolean check(int num){
		while(num!=0){
			if(num%10 !=0 && num%10!=1)return false;
			num/=10;
		}
		return true;
	}
	
	static int rec(int num,int i){
		if(num<0 || i>=64)
			return 1000000000;
		if(num==0)
			return 0;
		
		if(memo[num]!=-1)
			return memo[num];
		
		int x = rec(num,i+1);
		int x2 = 1+rec(num-quasi[i],i);
		int ways;
		if(x>x2){
			ways = x2;
			counter[i][num]=true;
		}
		else
			ways=x;
		return memo[num]=ways;
	}
	public static void main(String[] args)throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int n = Integer.parseInt(br.readLine());
		int ind = 0;
		quasi = new int[64];
		counter=new boolean[64][1000000+5];
		Arrays.fill(memo,-1);
		for(int i=1;i<=1000000;i++){
			if(check(i))
				quasi[ind++]=i;
		}
		System.out.println(rec(n,0));
		while(n!=0){
			for(int i=0;i<64;i++){
				if(counter[i][n]){
					System.out.print(quasi[i]+" ");
					n-=quasi[i];
					break;
				}
			}
		}
	}
}