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 quasi(int n) { return stoi(bitset<32>(n).to_string(), nullptr, 10); }
int main() {
  int n;
  cin >> n;
  int a[n + 2];
  memset(a, 0, sizeof(a));
  a[0] = 1;
  for (int i = 1;; ++i) {
    int q = quasi(i);
    if (q > n) break;
    for (int j = 1; j * q <= n; ++j) a[q * j] = j;
  }
  for (int i = 1; i <= n; ++i) {
    if (a[i] > 1)
      for (int j = 1; j < i; ++j) a[i] = min(a[i], a[i - j] + a[j]);
  }
  int count = a[n], k = 9;
  vector<string> v(count, string(10, '0'));
  int temp = n;
  while (temp) {
    int r = temp % 10;
    for (int i = 0; i < r; ++i) v[i][k] = '1';
    --k;
    temp /= 10;
  }
  cout << count << endl;
  copy(v.begin(), v.end(), ostream_iterator<string>(cout, " "));
  return 0;
}
