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

public class CF2 {
	static ArrayList<Integer> strings = new ArrayList<Integer>();

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		String numString = in.next();
		int numInt = Integer.parseInt(numString);
		ArrayList<Integer> ans = new ArrayList<Integer>();
		
		//Gen possible strings
		gen(0, new StringBuilder());
		strings.add(1000000);
		Collections.sort(strings, Collections.reverseOrder());
		strings.remove((Integer)0);
		
		for(int i = 0; i < strings.size(); i++){
			if(strings.get(i) > numInt)
				continue;
			
			while(numInt - strings.get(i) >= 0){
				ans.add(strings.get(i));
				numInt -= strings.get(i);
			}
		}
		
		Collections.sort(ans);
		System.out.println(ans.size());
		for(int i = 0; i < ans.size() - 1; i++)
			System.out.print(ans.get(i) + " ");
		System.out.println(ans.get(ans.size() - 1));
		
		in.close();
	}

	static void gen(int pos, StringBuilder perm){
		if(pos == 6){
			strings.add(Integer.parseInt(perm.toString()));
			return;
		}
		
		StringBuilder a = new StringBuilder(perm + "0");
		gen(pos + 1, a);
		StringBuilder b = new StringBuilder(perm + "1");
		gen(pos + 1, b);
	}
}
