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;
long long power[7] = {1, 10, 100, 1000, 10000, 100000, 1000000};
long long number(long long n) {
  int dig = 0;
  long long t = n;
  while (t) {
    t /= 10;
    dig++;
  }
  int k = dig - 1;
  long long ans = 0;
  while (k >= 0) {
    while ((ans + power[k]) > n) k--;
    if (k >= 0) {
      ans += power[k];
      k--;
    }
  }
  long long numb = n;
  long long ansi = ans;
  int l = 0;
  while (numb && ansi) {
    if ((numb % 10 == 0) && (ansi % 10)) {
      ans -= pow(10, l);
      l++;
      numb /= 10;
      ansi /= 10;
    } else
      break;
  }
  return ans;
}
int main() {
  long long n;
  cin >> n;
  long long temp = number(n);
  vector<long long> v;
  long long num = n;
  while (num) {
    temp = number(num);
    v.push_back(temp);
    num -= temp;
  }
  cout << v.size() << "\n";
  for (long long i = 0; i < v.size(); i++) cout << v[i] << " ";
  return 0;
}
