C. Sum of KEPpy Numbers Upsolve
A number is called a KEPpy number if its first digit is different from 0 and the rest of its digits are equal to 0. For example, 2000,1,30 are KEPpy numbers, 0,13,202 are not KEPpy numbers.
You are given a number and need to express it as a sum of KEPpy numbers.
Input
The first line contains an integer, n(1≤n≤109).
Output
Output the number of KEPpy numbers on the first line.
On the following line, output the numbers themselves.
If there are multiple solutions, output any of them.
Sample input 1
1234
Sample output 1
4 4 30 200 1000
Sample input 2
1
Sample output 2
1 1
Sample input 3
20
Sample output 3
1 20