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 MAX = 1e6;
vector<int> v;
int n, cnt, a, b, c;
short dp[65][MAX + 1], par[65][MAX + 1];
int check(int x) {
  while (x) {
    int z = x % 10;
    x /= 10;
    if (z > 1) return 0;
  }
  return 1;
}
short solve(int ind, short left) {
  if (!left) return 0;
  if (left < 0 || ind == v.size()) return 30000;
  if (dp[ind][left] != -1) return dp[ind][left];
  short ans = 30000;
  ans = min(ans, solve(ind + 1, left));
  if (ans != 30000) par[ind][left] = left;
  int hold = ans;
  ans = min(ans, (short)(solve(ind, left - v[ind]) + 1));
  if (ans != hold) par[ind][left] = left - v[ind];
  return dp[ind][left] = ans;
}
int main() {
  cin >> n;
  v.resize(64);
  for (int i = 1; i <= MAX; i++) {
    if (check(i)) v[cnt++] = i;
  }
  memset(dp, -1, sizeof(dp));
  cout << solve(0, n) << endl;
  a = 0, b = n;
  while (b) {
    c = par[a][b];
    if (c == b) {
      a++;
      continue;
    } else {
      cout << b - c << " ";
      b = c;
    }
  }
  return 0;
}
