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;


public class QuasiBinary {

	public static void main(String[] args) throws NumberFormatException, IOException 
	{
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		int n = Integer.parseInt(in.readLine());
		int i = 0;
		StringBuilder sB = new StringBuilder();
		while (n!=0)
		{
			int bCB = biggerCuasiBinary(n);
			n-=bCB;
			sB.append(bCB);
			sB.append(" ");
			++i;
		}
		System.out.println(i);
		System.out.println(sB.toString().trim());
	}
	
	public static int biggerCuasiBinary(int n)
	{
		int d  = digitos(n);
		int cBMin = (int) Math.pow(10, d-1);
		int cBMax = cBMin;
		while(--d > 0)
			 cBMax += (int) Math.pow(10, d-1);
		return Math.min(cBMax, n);
	}
	
	public static int digitos(int n)
	{
		int i = 1;
		while(n >=10)
		{
			n/=10;
			++i;
		}
		return i;
	}

}
