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;
const int INF = int(1e9);
vector<int> arr, d, p;
int n;
void fill() {
  arr.push_back(0);
  for (int i = 1; i <= n; i *= 10) {
    int q = int(arr.size());
    for (int j = 0; j < q; ++j) {
      arr.push_back(arr[j] + i);
    }
  }
}
void solve() {
  queue<int> q;
  for (int i = 1; i < int(arr.size()); ++i) {
    if (arr[i] <= n) {
      d[arr[i]] = 1;
      p[arr[i]] = arr[i];
      q.push(arr[i]);
    }
  }
  while (!q.empty()) {
    int v = q.front();
    q.pop();
    for (int i = 1; i < arr.size(); ++i) {
      int j = arr[i];
      j += v;
      if (j <= n && d[j] > d[v] + 1) {
        d[j] = d[v] + 1;
        p[j] = arr[i];
        q.push(j);
      } else {
        break;
      }
    }
    cout << v << endl;
  }
}
int main(int argc, char *argv[]) {
  scanf("%d", &n);
  d.resize(n + 1, INF);
  p.resize(n + 1);
  fill();
  solve();
  printf("%d\n", d[n]);
  while (n) {
    printf("%d ", p[n]);
    n -= p[n];
  }
  return 0;
}
