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 bs(long long a, long long b, long long l, long long h) {
  if (l > h) return 0;
  long long mid = (l + h) / 2;
  if (mid * mid * mid == a * b)
    return mid;
  else if (mid * mid * mid > a * b)
    return bs(a, b, l, mid - 1);
  else
    bs(a, b, mid + 1, h);
}
int spf[1000010];
int sieve() {
  spf[0] = 1;
  spf[1] = 1;
  for (long long i = 2; i < 1000010; i += 2) spf[i] = 2;
  for (long long i = 3; i < 1000010; i += 2) {
    if (spf[i]) continue;
    spf[i] = i;
    for (long long j = i * i; j < 1000010; j += i) {
      if (!spf[j]) spf[j] = i;
    }
  }
  return 0;
}
void fastscan(long long &number) {
  bool negative = false;
  register int c;
  number = 0;
  c = getchar();
  if (c == '-') {
    negative = true;
    c = getchar();
  }
  for (; (c > 47 && c < 58); c = getchar()) number = number * 10 + c - 48;
  if (negative) number *= -1;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long n;
  cin >> n;
  vector<long long> ans;
  while (n) {
    long long x = n;
    long long p = 1;
    while (x) x = x / 10, p = p * 10;
    p = p / 10;
    x = n;
    long long c = 0;
    while (x) {
      if (x / p == 0) {
      } else
        c = c + p * 1;
      x = x % p;
      p = p / 10;
    }
    n = n - c;
    ans.push_back(c);
  }
  cout << ans.size() << endl;
  for (long long i = 0; i < ans.size(); i++) cout << ans[i] << " ";
  return 0;
}
