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;
long long dp[1100000], v[1000006], k;
void pre() {
  for (int i = 0; i < 1000005; i++) dp[i] = 100000999;
  v[1] = 1;
  dp[1] = 1;
  int x = 0;
  dp[0] = 0;
  for (int i = 2;; i++) {
    v[i] = v[i / 2] * 10 + x;
    x = 1 - x;
    k = i;
    if (v[i] > 1000000) break;
    dp[v[i]] = 1;
  }
}
void print(int x) {
  for (int i = 1; i <= k; i++) {
    if (v[i] <= x) {
      if (1 + dp[x - v[i]] == dp[x]) {
        cout << v[i] << " ";
        print(x - v[i]);
        break;
      }
    }
  }
}
int main() {
  pre();
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= k; j++) {
      if (v[j] <= i) {
        dp[i] = min(dp[i], 1 + dp[i - v[j]]);
      }
    }
  }
  cout << dp[n] << endl;
  print(n);
}
