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 main() {
  ios_base::sync_with_stdio(false);
  int n;
  cin >> n;
  vector<int> v[6];
  v[1].push_back(1);
  for (int i = 2; i <= 5; i++) {
    for (int j = 0; j < v[i - 1].size(); j++) {
      v[i].push_back(v[i - 1][j] * 10);
      v[i].push_back((v[i - 1][j] * 10) + 1);
    }
    sort(v[i].begin(), v[i].end(), greater<int>());
  }
  if (n == 1000000) {
    cout << "1\n1000000\n";
  } else {
    int x = 0;
    while (n % 10 == 0) {
      x++;
      n = n / 10;
    }
    int u = 1;
    for (int i = 1; i <= x; i++) {
      u = u * 10;
    }
    int m = n;
    int c = 0;
    vector<int> answer;
    while (m) {
      m = m / 10;
      c++;
    }
    while (n) {
      for (int i = 0; i < v[c].size(); i++) {
        if ((n >= v[c][i])) {
          answer.push_back(v[c][i]);
          n = n - v[c][i];
          break;
        }
      }
      c = 0;
      m = n;
      while (m) {
        m = m / 10;
        c++;
      }
    }
    cout << answer.size() << "\n";
    for (int i = 0; i < answer.size(); i++) {
      cout << answer[i] * u << " ";
    }
    cout << "\n";
  }
}
