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.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;

public class B489 {
	public static void main(String[] args) throws NumberFormatException, IOException {
		//precompute array of quasibinary numbers
		boolean[] quasi = new boolean[(int)(1e6+1)];
		precompute(quasi);
		BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter out = new PrintWriter(System.out);
		int n = Integer.parseInt(f.readLine());
		ArrayList<Integer> nums = new ArrayList<Integer>();
		for(int i = n; i >= 1; i--) {
			if(!quasi[i]) continue;
			while(n >= i) {
				nums.add(i);
				n-=i;
			}
		}
		System.out.println(nums.size());
		for(int i = 0; i < nums.size(); i++) out.print(nums.get(i) + " ");
		out.close();
	}
	
	static void precompute(boolean[] quasi) {
		for(int i = 0; i < quasi.length; i++) {
			int n = i;
			boolean add = true;
			while(n > 0) {
				if(n%10 != 1 && n%10 != 0) {
					quasi[i] = false;
					add=false;
					break;
				}
				n/=10;
			}
			if(add)quasi[i] = true;
		}
	}
}
