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

public class QuasiBinary {

	// https://codeforces.com/problemset/problem/538/B
	
	public static void main(String[] args) throws IOException, FileNotFoundException {
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		//BufferedReader in = new BufferedReader(new FileReader("QuasiBinary"));

		int n = Integer.parseInt(in.readLine());  
		HashMap<Integer, Integer> value = new HashMap<>();
		int index = 0;
		while (n > 0) {
			int cur = n % 10;
			value.put((int)Math.pow(10, index), cur);
			n /= 10;
			index++;
		}
		
		ArrayList<Integer> f = new ArrayList<>();
		while (value.size() > 0) {
			f.add(0);
			int ind = f.size()-1;
			ArrayList<Integer> remove = new ArrayList<>();
			for (Integer a : value.keySet()) {
				if (value.get(a) == null) continue;
				if (value.get(a) <= 0) {
					remove.add(a);
				}
				else {
					f.set(ind, f.get(ind) + a);
					value.put(a, value.get(a)-1);
					if (value.get(a) <= 0) {
						remove.add(a);
					}
				}
			}
			for (int i = 0; i < remove.size(); i++) value.remove(remove.get(i));
		}
		
		System.out.println(f.size());
		for (int i = 0; i < f.size(); i++) {
			System.out.print(f.get(i) + " ");
		}

	}

}
