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 int MOD = 1000000007ll;
using namespace std;
int main() {
  std::ios_base::sync_with_stdio(false);
  int ar[9][6] = {};
  int n, h = 0;
  cin >> n;
  if (n == 1000000) {
    cout << "1\n1000000";
    return 0;
  }
  while (n > 0) {
    int c = n % 10;
    n = n / 10;
    for (int i = 0; i < c; i++) {
      ar[i][h] = 1;
    }
    h++;
  }
  int num[9] = {};
  for (int i = 0; i < 9; i++) {
    num[i] += ar[i][5] * 100000;
    num[i] += ar[i][4] * 10000;
    num[i] += ar[i][3] * 1000;
    num[i] += ar[i][2] * 100;
    num[i] += ar[i][1] * 10;
    num[i] += ar[i][0] * 1;
  }
  int count = 0;
  for (int i = 0; i < 9; i++) {
    if (num[i] > 0) {
      count++;
    }
  }
  cout << count << endl;
  for (int i = 8; i >= 0; i--) {
    if (num[i] > 0) {
      cout << num[i] << " ";
    }
  }
  return 0;
}
