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 thenumber(int q, int r) {
  if (q != 1) {
    q--;
    int roger = pow(10, q);
    return roger;
  }
  return 1;
}
int func(int n) {
  int q = 0;
  do {
    ++q;
    n /= 10;
  } while (n);
  return q;
}
int main() {
  int n;
  cin >> n;
  int r = n;
  int q = func(n);
  vector<int> mul;
  while (n > 0) {
    int so = thenumber(func(n), n);
    mul.push_back(so);
    n -= so;
  }
  vector<int> ruuu(mul.size(), 0);
  for (int loop = 0; loop < mul.size(); loop++) {
    int ssq = mul[loop];
    if (ssq == 0) {
      continue;
    }
    ruuu[loop] += mul[loop];
    for (int i = loop + 1; i < mul.size(); i++) {
      if (mul[i] != ssq && mul[i] != 0) {
        int ru = mul[i];
        mul[i] = 0;
        ruuu[loop] += ru;
        ssq = ru;
      }
    }
  }
  int ans = 0;
  for (int loop = 0; loop < ruuu.size(); loop++) {
    if (ruuu[loop] != 0) {
      ans++;
    }
  }
  cout << ans << '\n';
  for (int loop = 0; loop < mul.size(); loop++) {
    if (ruuu[loop] != 0) {
      cout << ruuu[loop] << " ";
    }
  }
  cout << '\n';
}
