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 IntToStr(int x) {
  stringstream r;
  string str;
  r << x;
  str = r.str();
  return str.length();
}
struct point {
  int y, x;
};
int main() {
  int n, s = 0, r = 0, l, a = 0, b = 1, c = 10, d = 100, e = 1000, f = 10000,
         g = 100000, h = 1000000, k = 0;
  vector<int> mas;
  cin >> n;
  if (n == 0) {
    printf("1\n0");
    return 0;
  }
  while (n > 0) {
    r = 0;
    if ((n - r) >= h) {
      r += h;
    }
    if ((n - r) >= g) {
      r += g;
    }
    if ((n - r) >= f) {
      r += f;
    }
    if ((n - r) >= e) {
      r += e;
    }
    if ((n - r) >= d) {
      r += d;
    }
    if ((n - r) >= c) {
      r += c;
    }
    if ((n - r) >= b) {
      r += b;
    }
    n -= r;
    mas.push_back(r);
    k++;
  }
  cout << k << endl;
  for (int i = 0; i < k; i++) {
    cout << mas[i];
    if (i != k - 1) printf(" ");
  }
}
