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;
vector<int> v;
int dp[1000001];
int bk[1000005];
int32_t main() {
  int n;
  cin >> n;
  for (int i = 0; i <= n; i++) dp[i] = (int)1e9;
  for (int i = 1; i <= 1000000; i++) {
    int maxxi = 0;
    int t = i;
    while (t > 0) {
      maxxi = max(maxxi, t % 10);
      t /= 10;
    }
    if (maxxi == 1) v.push_back(i), dp[i] = 1, bk[i] = i;
  }
  dp[1] = 1;
  bk[1] = 1;
  for (int i = 2; i <= n; i++) {
    for (int j = 0; j < v.size(); j++) {
      if (i - v[j] < 0) break;
      if (dp[i - v[j]] + 1 < dp[i]) {
        bk[i] = v[j];
        dp[i] = dp[i - v[j]] + 1;
      }
    }
  }
  cout << dp[n] << endl;
  while (n > 0) {
    cout << (bk[n]) << " ";
    n -= bk[n];
  }
}
