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 maxn = 1e6 + 1;
int dp[maxn], qus[maxn];
vector<int> rep[maxn];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  int n, cntr = 10, ptr = 2, cn = 2;
  cin >> n;
  qus[0] = 0;
  qus[1] = 1;
  while (cntr <= n) {
    int c = ptr;
    for (int i = 0; i < ptr; i++) {
      qus[i + ptr] = qus[i] + cntr;
      c++;
      cn++;
    }
    ptr = c;
    cntr *= 10;
  }
  for (int i = 1; i <= n; i++) {
    int l = 0, r = cn - 1, mid = (r + l) / 2;
    while (r - l > 1) {
      if (qus[mid] >= i)
        r = mid;
      else
        l = mid;
      mid = (r + l) / 2;
    }
    if (qus[r] > i) r--;
    int miner = 10000000, num = qus[0];
    for (int j = 1; j <= r; j++) {
      int si = rep[i - qus[j]].size();
      if (si + 1 < miner) {
        miner = si + 1;
        num = qus[j];
      }
    }
    dp[i] = num;
    for (int j = 0; j < rep[i - num].size(); j++)
      rep[i].push_back(rep[i - num][j]);
    rep[i].push_back(num);
  }
  cout << rep[n].size() << endl;
  for (int i = 0; i < rep[n].size(); i++) cout << rep[n][i] << " ";
  cout << endl;
  return 0;
}
