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;
void generate(string s, vector<int>& gen, int len) {
  if (len == 7) return;
  int x;
  stringstream geek(s + '0');
  geek >> x;
  gen.push_back(x);
  generate(s + '0', gen, len + 1);
  stringstream geek1(s + '1');
  geek1 >> x;
  gen.push_back(x);
  generate(s + '1', gen, len + 1);
}
int main() {
  int n;
  cin >> n;
  vector<int> gen;
  string s = "";
  generate(s, gen, 0);
  sort(gen.begin(), gen.end());
  vector<int>::iterator it;
  it = unique(gen.begin(), gen.end());
  gen.resize(it - gen.begin());
  int ans[1000002];
  int minn[1000002];
  for (int i = 0; i <= 1000000; i++) ans[i] = 1000009;
  ans[0] = 0;
  for (int i = 1; i <= 1000000; i++) {
    for (int j = 1; j < gen.size(); j++) {
      if (gen[j] > i)
        break;
      else {
        if (ans[i] > (1 + ans[i - gen[j]])) {
          ans[i] = 1 + ans[i - gen[j]];
          minn[i] = gen[j];
        }
      }
    }
  }
  cout << ans[n] << "\n";
  while (n != 0) {
    cout << minn[n] << " ";
    n = n - minn[n];
  }
}
