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>
const long long mod = (1e9 + 7);
using namespace std;
template <typename T>
ostream& operator<<(ostream& o, vector<T> a) {
  size_t n = a.size();
  size_t i = 0;
  while (a[i] == 0) i++;
  for (; i < n; i++) {
    o << a[i];
  }
  o << " ";
  return o;
}
template <typename T>
void display(T a[], int n) {
  for (int i = 0; i < n; i++) {
    cout << a[i] << " ";
  }
  cout << endl;
}
int solve() {
  string s;
  cin >> s;
  vector<int> a, c;
  vector<vector<int> > ans;
  for (int i = 0; i < s.size(); i++) {
    a.push_back(s[i] - '0');
    c.push_back(1);
  }
  int k = 0, flag = 1;
  while (flag) {
    flag = 0;
    for (long long i = 0; i < s.size(); i++) {
      if (a[i] == 0)
        c[i] = 0;
      else
        flag = 1;
      a[i] = a[i] - c[i];
    }
    ans.push_back(c);
    if (flag) k++;
  }
  cout << k << endl;
  for (long long i = 0; i < k; i++) {
    cout << ans[i];
  }
  return 0;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  for (long long i = 0; i < t; i++) solve();
  return 0;
}
