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 double eps = 1e-8;
const int MAXN = (int)1e6 + 1;
using namespace std;
std::vector<int> res;
const int quasibinarys[64] = {
    1,      10,     11,     100,    101,    110,    111,    1000,
    1001,   1010,   1011,   1100,   1101,   1110,   1111,   10000,
    10001,  10010,  10011,  10100,  10101,  10110,  10111,  11000,
    11001,  11010,  11011,  11100,  11101,  11110,  11111,  100000,
    100001, 100010, 100011, 100100, 100101, 100110, 100111, 101000,
    101001, 101010, 101011, 101100, 101101, 101110, 101111, 110000,
    110001, 110010, 110011, 110100, 110101, 110110, 110111, 111000,
    111001, 111010, 111011, 111100, 111101, 111110, 111111, 1000000};
int main(int argc, char const *argv[]) {
  int n;
  cin >> n;
  int res = 0;
  std::vector<int> digit;
  while (n) {
    digit.push_back(n % 10);
    res = max(res, n % 10);
    n /= 10;
  }
  reverse(digit.begin(), digit.end());
  cout << res << endl;
  while (res--) {
    string tmp;
    for (int i = 0; i < digit.size(); i++) {
      if (digit[i]) {
        digit[i]--;
        tmp += '1';
      } else
        tmp += '0';
    }
    cout << tmp << " ";
  }
  return 0;
}
