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() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  string s;
  cin >> s;
  char mx = '0';
  for (auto k : s) mx = max(k, mx);
  long long int n = mx - 48, m = (int)s.size();
  bool ans[n][m];
  for (long long int i = 0; i < n; i++)
    for (long long int j = 0; j < m; j++) ans[i][j] = 0;
  for (long long int i = 0; i < (int)s.size(); i++) {
    long long int x = (int)s[i] - 48;
    for (long long int j = 0; j < x; j++) {
      ans[j][i] = 1;
    }
  }
  cout << n << "\n";
  for (long long int i = 0; i < n; i++) {
    bool one = false;
    for (long long int j = 0; j < m; j++) {
      if (ans[i][j] == 1) one = true;
      if (one) {
        if (ans[i][j])
          cout << 1;
        else
          cout << 0;
      }
    }
    cout << " ";
  }
  return 0;
}
