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>
#pragma comment(linker, "/STACK:133217728")
using namespace std;
const int MOD = 1000000007;
const int INF = 1000000007;
int dp[1000000];
int pr[1000000];
vector<int> v;
int main() {
  int n;
  cin >> n;
  if (n == 1000000) {
    cout << 1 << endl;
    cout << n << endl;
    return 0;
  }
  for (int i = (1); i < (1 << 6); ++i) {
    int s = 0;
    for (int j = (6) - 1; j >= (0); --j) {
      s *= 10;
      if ((i >> j) & 1) s++;
    }
    v.push_back(s);
  }
  dp[0] = 0;
  for (int i = (1); i < (1000000); ++i) {
    dp[i] = INF;
  }
  for (int i = (0); i < (1000000); ++i) {
    for (int j = (0); j < (v.size()); ++j)
      if (i + v[j] < 1000000) {
        if (dp[i] + 1 < dp[i + v[j]]) {
          dp[i + v[j]] = dp[i] + 1;
          pr[i + v[j]] = v[j];
        }
      }
  }
  cout << dp[n] << endl;
  while (n > 0) {
    cout << pr[n] << " ";
    n -= pr[n];
  }
  return 0;
}
