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.ArrayList;
import java.util.List;
import java.util.Scanner;

public class B_538 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub

		Scanner scanner = new Scanner(System.in);
		System.out.println(qausiBinary(scanner.nextInt()));
		for (int i = 0; i < out.size(); i++) {
			System.out.print(i<out.size()-1? out.get(i)+" ":out.get(i));
		}
		scanner.close();
	}
	static List<Integer> out= new ArrayList<Integer>();
	static int qausiBinary(int n) {
		
		if(n==0)
			return 0;
		if(isQausi(n)) {
			out.add(n);
			return 1;
		}
		int ret=0;
		for (int i = n-1; i > 0; i--) {
			if(isQausi(i)) {
				ret += qausiBinary(n-i) + 1;
				out.add(i);
				break;
			}
		}
		
		return ret;
	}
	
	static boolean isQausi(int n) {
		for (char i : String.valueOf(n).toCharArray()) {
			int a = i -'0';
			if(a>1)
				return false;
		}
		return true;
	}

}
