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 a[1000005];
int b[11];
int get(int p) {
  int s = 0, i;
  for (i = p - 1; i >= 0; i--) {
    if (b[i] > 0)
      s = s * 10 + 1;
    else
      s = s * 10;
  }
  return s;
}
int main() {
  int i, n, k;
  cin >> n;
  k = 0;
  while (n > 0) {
    int p = 0, w = n;
    while (w > 0) {
      b[p++] = w % 10;
      w = w / 10;
    }
    int q = get(p);
    a[k++] = q;
    n = n - q;
  }
  printf("%d\n", k);
  for (i = k - 1; i >= 0; i--) printf("%d ", a[i]);
}
