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 s;
int d[10];
int p[10];
int main() {
  cin >> s;
  int sz = s.size();
  for (int i = 0; i <= sz - 1; i++) {
    d[i] = s[i] - '0';
  }
  int n = s.size();
  p[1] = 1;
  p[2] = 10;
  p[3] = 100;
  p[4] = 1000;
  p[5] = 10000;
  p[6] = 100000;
  p[7] = 1000000;
  vector<int> ans;
  while (1) {
    bool nolsemua = true;
    int angka = 0;
    int nkali = 1e6;
    for (int i = n - 1; i >= 0; i--) {
      int hoho = p[n - i];
      if (d[i] == 0) {
        continue;
      }
      nkali = min(d[i], nkali);
      angka += hoho;
    }
    for (int i = 0; i <= n - 1; i++) {
      if (d[i] > 0) {
        d[i] -= nkali;
      }
    }
    for (int i = 0; i <= nkali - 1; i++) {
      ans.emplace_back(angka);
    }
    for (int i = 0; i <= n - 1; i++) {
      if (d[i] != 0) {
        nolsemua = false;
        break;
      }
    }
    if (nolsemua) {
      break;
    }
  }
  cout << ans.size() << "\n";
  for (auto &e : ans) {
    cout << e << " ";
  }
  return 0;
}
