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>
int n;
int dp[1000005];
int prev[1000005];
int nsan;
int sanlar[100];
int main() {
  scanf("%d", &n);
  for (int i = 0; i <= n; i++) dp[i] = -1;
  int bas = 0;
  sanlar[0] = 1;
  nsan = 1;
  while (bas < nsan) {
    if (sanlar[bas] * 10 <= n) {
      sanlar[nsan] = sanlar[bas] * 10;
      nsan++;
    }
    if (sanlar[bas] * 10 + 1 <= n) {
      sanlar[nsan] = sanlar[bas] * 10 + 1;
      nsan++;
    }
    bas++;
  }
  dp[0] = 0;
  prev[0] = 0;
  for (int i = 0; i <= n; i++) {
    for (int j = 0; j < nsan; j++)
      if (sanlar[j] + i <= n &&
          (dp[sanlar[j] + i] == -1 || dp[sanlar[j] + i] > dp[i] + 1)) {
        dp[sanlar[j] + i] = dp[i] + 1;
        prev[sanlar[j] + i] = i;
      }
  }
  printf("%d\n", dp[n]);
  bas = n;
  while (1) {
    printf("%d ", bas - prev[bas]);
    bas = prev[bas];
    if (bas == 0) break;
  }
  printf("\n");
}
