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 power(int x, int y) {
  int p;
  if (y == 0) {
    return 1;
  }
  p = power(x, y / 2);
  if (y % 2 == 0) {
    return p * p;
  } else {
    return x * p * p;
  }
}
int tedad(int n) {
  int ted = 0;
  while (n != 0) {
    ted = ted + 1;
    n /= 10;
  }
  return ted;
}
int main() {
  int n, a[9], j = 0, temp = 0, t;
  cin >> n;
  a[0] = a[1] = a[2] = a[3] = a[4] = a[5] = a[6] = a[7] = a[8] = 0;
  while (n != 0) {
    for (int i = 0; i < tedad(n); i++) {
      t = n / power(10, i) % 10;
      if (t != 0) {
        temp += 1 * power(10, i);
      }
    }
    a[j] = temp;
    n -= temp;
    j++;
    temp = 0;
  }
  cout << j << "\n";
  for (int y = 0; y < 9; y++) {
    if (a[y] != 0) {
      cout << a[y] << " ";
    }
  }
}
