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.*;
import java.lang.*;
import java.io.*;

public class QuasiBinary{
	static int limit = (int)1e6;
	static ArrayList<Integer> qb;
	public static void main (String[] args) throws Exception{
		Scanner sc = new Scanner(System.in);
		qb = new ArrayList<>();
		findAllQB(1);
		
		int n = sc.nextInt();
		int dp0[] = new int[n+1];
		int dp1[] = new int[n+1];
		int dp2[] = new int[n+1];
		Arrays.fill(dp0, limit+1);
		Arrays.fill(dp1, -1);
		Arrays.fill(dp2, -1);
		dp0[0] = 0;
		for(int qbi: qb){
			for(int j=qbi; j<=n; j++){
				if(dp0[j]>dp0[j-qbi] + 1){
					dp0[j] = dp0[j-qbi] + 1;
					dp1[j] = j-qbi;
					dp2[j] = qbi;
				}
			}
		}
		
		ArrayList<Integer> ans = new ArrayList<>();
		while(dp2[n]>-1){
			ans.add(dp2[n]);
			n = dp1[n];
		}
		System.out.println(ans.size());
		for(int v: ans)
			System.out.print(v+" ");
	}
	
	static void findAllQB(int n){
		if(n>limit)
			return;
		qb.add(n);
		findAllQB(n*10);
		findAllQB(n*10 + 1);
	}
}