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;
string a;
long long td(char x) { return x - '0'; }
int main() {
  long long cur = 0;
  cin >> a;
  long long as[10], c[10] = {0};
  for (int i = 0; i < a.size(); ++i) {
    cur = max(cur, td(a[i]));
    as[i] = td(a[i]);
  }
  cout << cur << endl;
  for (int i = 0; i < a.size(); ++i) {
    for (int j = 1; j <= cur; ++j) {
      if (as[i] > 0) {
        c[j] = c[j] * 10 + 1;
        --as[i];
      } else {
        c[j] = c[j] * 10;
      }
    }
  }
  for (int i = 1; i <= cur; ++i) {
    cout << c[i] << " ";
  }
}
