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

#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  int a[] = {1,      10,     11,     100,    101,    110,    111,    1000,
             1001,   1010,   1011,   1100,   1101,   1110,   1111,   10000,
             10001,  10010,  10011,  10100,  10101,  10110,  10111,  11000,
             11001,  11010,  11011,  11100,  11101,  11110,  11111,  100000,
             100001, 100010, 100011, 100100, 100101, 100110, 100111, 101000,
             101001, 101010, 101011, 101100, 101101, 101110, 101111, 110000,
             110001, 110010, 110011, 110100, 110101, 110110, 110111, 111000,
             111001, 111010, 111011, 111100, 111101, 111110, 111111, 1000000};
  int l[n + 1];
  int m[n + 1];
  m[0] = 0;
  l[0] = 0;
  int i = 0;
  while (++i <= n) {
    l[i] = 1e9;
    int j = -1;
    while (++j < 64) {
      if (i >= a[j] && l[i] > 1 + l[i - a[j]])
        l[i] = 1 + l[i - a[j]], m[i] = a[j];
    }
  }
  cout << l[n] << endl;
  i = m[n];
  while (i) {
    cout << i << " ";
    n = n - i;
    i = m[n];
  }
}
