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 dp[1000005];
int mx[1000005];
int main() {
  fill(mx, mx + 1000005, 1);
  dp[1] = 1;
  int cnt = 0, i, j;
  for (i = 0; i < 1000005; i++) dp[i] = i;
  mx[1] = 1;
  int prev = 1;
  for (i = 2; i < 1000005; i++) {
    int k = i;
    cnt = 0;
    int p = 0;
    while (k > 0) {
      int rm = k % 10;
      if (rm == 0 || rm == 1) cnt++;
      k = k / 10;
      p++;
    }
    if (p == cnt) {
      dp[i] = 1;
      mx[i] = i;
      for (j = i + 1; j < 1000005; j++) {
        if (dp[j] > dp[j - i] + 1) {
          dp[j] = dp[j - i] + 1;
          mx[j] = i;
        }
      }
    }
  }
  int n;
  cin >> n;
  cout << dp[n] << endl;
  int sm1 = 0;
  int k = n;
  while (sm1 != n) {
    cout << mx[k] << " ";
    sm1 += mx[k];
    k = k - mx[k];
  }
  printf("\n");
  return 0;
}
