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 n, cif[8];
int pz[6];
vector<int> ans;
int main() {
  cin >> n;
  int cn = n, cf = 0;
  while (cn) ++cf, cn /= 10;
  cn = n;
  pz[cf + 1] = 1;
  for (int i = cf; cn; --i) cif[i] = cn % 10, cn /= 10, pz[i] = pz[i + 1] * 10;
  while (1) {
    int act = 0;
    for (int i = 1; i <= cf; ++i) {
      if (cif[i] > 0) {
        act += pz[i] / 10;
        --cif[i];
      }
    }
    if (!act) break;
    ans.push_back(act);
  }
  sort(ans.begin(), ans.end());
  cout << ans.size() << '\n';
  for (auto x : ans) cout << x << ' ';
  return 0;
}
