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.*;
import java.util.*;
import java.math.*;

public class Div1_300_B {
	public static void main(String[] args) throws IOException {
		BufferedInputStream bis = new BufferedInputStream(System.in);
		BufferedReader br = new BufferedReader(new InputStreamReader(bis));
		StringTokenizer st;
		int [] quasiNumbers = generateQuasi();
		int num = Integer.parseInt(br.readLine().trim());
		int k = 0;
		StringBuffer ans = new StringBuffer("");
		for(int i = 0;i < quasiNumbers.length && num > 0;i++) {
			while(num >= quasiNumbers[i]) {
				k++;
				ans = ans.append(quasiNumbers[i]+" ");
				num -= quasiNumbers[i];
			}
		}
		//System.out.println(Arrays.toString(quasiNumbers));
		System.out.println(k);
		ans.deleteCharAt(ans.length()-1);
		System.out.println(ans);
	}
	public static int [] generateQuasi() {
		TreeSet<Integer> res = new TreeSet<Integer>();
		TreeSet<Integer> curr = new TreeSet <Integer>();
		curr.add(1);
		res.add(1);
		for(int i = 0;i < 6;i++) {
			TreeSet<Integer> next = new TreeSet<Integer>();
			for(int r:curr) {
				for(int j = 0;j < 2;j++) {
					int nnum = r*10+j;
					next.add(nnum);
				}
			}
			res.addAll(next);
			curr = next;
		}
		int [] resArr = new int[res.size()];
		int i = 0;
		for(int n:res) {
			resArr[resArr.length-1-i] = n;
			i++;
		}
		return resArr;
	}
}