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;
int Q[65];
int p[10] = {1, 10, 100, 1000, 10000, 100000, 1000000};
int conv(int x) {
  int i = 0;
  int res = 0;
  while (x != 0) {
    if (x & 1) res += p[i];
    x >>= 1;
    i++;
  }
  return res;
}
void fill_Q() {
  for (int i = 1; i < 65; i++) Q[i] = conv(i);
}
int DP[1000003];
int main() {
  int n;
  cin >> n;
  memset(Q, 0, sizeof Q);
  fill_Q();
  fill(DP, DP + n + 1, 10000000);
  DP[0] = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < 65; j++) {
      if (Q[j] > i) break;
      DP[i] = min(DP[i], DP[i - Q[j]]);
    }
    DP[i]++;
  }
  cout << DP[n] << endl;
  vector<int> res;
  while (n > 0)
    for (int i = 0; i < 65; i++)
      if (DP[n - Q[i]] == DP[n] - 1) {
        n -= Q[i];
        res.push_back(Q[i]);
        break;
      }
  for (int i = 0; i < res.size(); i++) cout << res[i] << " ";
  cout << endl;
  return 0;
}
