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 int maxn = 1e5 + 10;
const int MaxN = 0x3f3f3f3f;
const int MinN = 0xc0c0c00c;
using namespace std;
int main() {
  string n;
  int a[100] = {0};
  cin >> n;
  int f, t = n.size();
  for (int i = 0; i < t; i++) {
    a[i + 1] = n[i] - '0';
  }
  int sum = 0;
  for (int i = 1; i <= t; i++) {
    sum = max(sum, a[i]);
  }
  string s[10];
  int ff[10] = {0};
  for (int i = 1; i <= t; i++) {
    for (int j = 1; j <= sum; j++) {
      if (a[i] != 0) {
        s[j] += '1';
        a[i]--;
        ff[j] = 1;
      } else {
        if (ff[j]) {
          s[j] += '0';
        }
      }
    }
  }
  cout << sum << endl;
  for (int i = 1; i <= 9; i++) {
    cout << s[i] << " ";
  }
}
