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;
const int N = 1e6 + 5;
int main() {
  vector<int> v;
  for (int i = 1; i < N; i++) {
    int z;
    z = i;
    bool p = 1;
    while (z) {
      if (z % 10 == 1 || z % 10 == 0) {
        z = z / 10;
        continue;
      } else {
        p = 0;
        break;
      }
    }
    if (p) v.push_back(i);
  }
  int dp[N][2];
  for (int i = 0; i < N; i++) {
    dp[i][0] = INT_MAX;
  }
  for (auto it : v) {
    dp[it][0] = 1;
    dp[it][1] = it;
  }
  for (int i = 1; i < N; i++) {
    if (dp[i][0] != INT_MAX) {
      for (auto it : v) {
        int z = i + it;
        if (z < N) {
          if (dp[z][0] > dp[i][0] + 1) {
            dp[z][0] = dp[i][0] + 1;
            dp[z][1] = it;
          }
        } else {
          break;
        }
      }
    }
  }
  int n;
  scanf("%d", &n);
  ;
  cout << dp[n][0] << "\n";
  vector<int> ans;
  while (n != 0) {
    ans.push_back(dp[n][1]);
    n = n - dp[n][1];
  }
  for (auto it : ans) cout << it << " ";
}
