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 main() {
  int n, i, j;
  string s;
  cin >> n;
  queue<int> q;
  vector<int> v;
  q.push(1);
  v.push_back(1);
  while (!q.empty()) {
    int x = q.front();
    q.pop();
    int l = x * 10;
    if (l <= 1000000) {
      q.push(l);
      v.push_back(l);
    }
    l++;
    if (l <= 1000000) {
      q.push(l);
      v.push_back(l);
    }
  }
  vector<pair<int, int> > a;
  a.push_back(make_pair(0, 0));
  a.push_back(make_pair(1, 1));
  for (i = 2; i < 1000000 + 10; i++) {
    int m = 1000000, k;
    for (j = 0; j < v.size(); j++) {
      if (i - v[j] < 0) break;
      if (m > a[i - v[j]].second + 1) {
        m = a[i - v[j]].second + 1;
        k = v[j];
      }
    }
    a.push_back(make_pair(k, m));
  }
  vector<int> g;
  while (n) {
    g.push_back(a[n].first);
    n -= a[n].first;
  }
  cout << g.size() << endl;
  for (i = 0; i < g.size(); i++) {
    cout << g[i] << " ";
  }
  return 0;
}
