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>
long largestQbinary(long n);
using namespace std;
int main() {
  long n, qBinary, numbers = 0;
  int num = 0;
  scanf("%ld", &n);
  long arr[n];
  while (n > 0) {
    qBinary = largestQbinary(n);
    n = n - qBinary;
    arr[num++] = qBinary;
  }
  printf("%d\n", num);
  for (int j = 0; j < num; j++) {
    printf("%d ", arr[j]);
  }
  return 0;
}
long largestQbinary(long n) {
  long qBinary = 0, temp = n, digits = 0;
  int temp_dig;
  while (temp) {
    digits++;
    temp = temp / 10;
  }
  while (digits) {
    temp_dig = n / pow(10, digits - 1);
    if (temp_dig > 1) {
      for (int i = digits; i > 0; i--) {
        qBinary = qBinary + pow(10, i - 1);
      }
      break;
    } else if (temp_dig == 1) {
      qBinary = qBinary + pow(10, digits - 1);
      digits--;
      n = n - pow(10, digits);
    } else if (temp_dig == 0) {
      digits--;
      n = n - pow(10, digits);
    }
  }
  return qBinary;
}
