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 N = 1e6 + 6;
const int INF = 1e9;
int n;
vector<int> a;
void generate() {
  for (int i = 1; i <= (1 << 6); i++) {
    int x = i, num = 0, stt = 0;
    while (x) {
      num += (x & 1) * pow(10, stt);
      x >>= 1;
      stt++;
    }
    a.push_back(num);
  }
}
int f[N], trace[N];
int main() {
  cin >> n;
  generate();
  fill(f, f + N, INF);
  f[0] = 0;
  for (int i = 1; i <= n; i++) {
    for (int x : a) {
      if (i - x < 0) break;
      if (1 + f[i - x] < f[i]) {
        f[i] = 1 + f[i - x];
        trace[i] = x;
      }
    }
  }
  cout << f[n] << endl;
  while (n > 0) {
    cout << trace[n] << " ";
    n -= trace[n];
  }
  cout << endl;
  return 0;
}
