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;
void fun(int n, int l, vector<vector<int>>& v) {
  n = n * 10;
  if ((int)log10(n) + 1 == l) {
    v[l].push_back(n);
    v[l].push_back(n + 1);
  } else if (log10(n) + 1 < l) {
    fun(n, l, v);
    fun(n + 1, l, v);
  }
}
int main() {
  int n;
  cin >> n;
  int co = log10(n) + 1;
  vector<vector<int>> v(co + 1, vector<int>());
  vector<int> ans;
  for (int i = 1; i <= co; i++) {
    if (i == 1) {
      v[i].push_back(1);
      v[i].push_back(0);
    } else {
      fun(1, i, v);
      sort(v[i].begin(), v[i].end(), greater<int>());
    }
  }
  int c = log10(n) + 1;
  while (n > 0) {
    c = log10(n) + 1;
    for (auto x : v[c]) {
      if (n >= x) {
        while ((n - x) >= 0) {
          ans.push_back(x);
          n -= x;
        }
        if (n == 0) {
          break;
        }
      }
      if (log10(n) + 1 != c) {
        break;
      }
    }
  }
  sort(ans.begin(), ans.end());
  cout << ans.size() << endl;
  for (auto x : ans) {
    cout << x << " ";
  }
  return 0;
}
