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;
const double PI = 2 * acos(0.0), eps = 1e-8;
const long long oo = 1000000000000000000;
template <class T>
void show(const vector<T> &a) {
  cout << ((long long)(a.size())) << endl;
  for (T first : a) cout << first << " ";
  cout << endl;
}
const long long M = 998244353;
long long MOD(long long a) {
  if (a >= 0) return a >= M ? a % M : a;
  if (a <= -M) a %= M;
  return a ? a + M : a;
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n;
  cin >> n;
  vector<long long> v(7), z;
  long long u = 6;
  while (n != 0) {
    v[u] = n % 10;
    n /= 10;
    u--;
  }
  while (true) {
    long long p = 0;
    for (long long i = 0; i < 7; i++) {
      p = p * 10;
      if (v[i]) {
        p++;
        v[i]--;
      }
    }
    if (p == 0) break;
    z.push_back(p);
  }
  cout << z.size() << endl;
  for (long long i = 0; i < z.size(); i++) cout << z[i] << " ";
}
