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 int INF = 1 + 1e9;
int trace[1000001];
int n;
int f[1000001];
int s[80];
vector<int> ans;
int main() {
  cin >> n;
  int d = 0;
  s[d++] = 1;
  for (int i = 0; i < d; ++i) {
    if (s[i] * 10 <= n) s[d++] = s[i] * 10;
    if (s[i] * 10 + 1 <= n) s[d++] = s[i] * 10 + 1;
  }
  for (int i = 0, _b = (d); i < _b; i++) cout << s[i] << " ";
  cout << endl;
  fill(f, f + n + 1, INF);
  f[0] = 0;
  for (int i = 1, _b = (n); i <= _b; i++)
    for (int j = 0, _b = (d); j < _b; j++) {
      if (s[j] <= i) {
        if (f[i] > f[i - s[j]] + 1) {
          f[i] = f[i - s[j]] + 1;
          trace[i] = i - s[j];
        }
      } else
        break;
    }
  cout << f[n] << endl;
  while (n > 0) {
    ans.push_back(n - trace[n]);
    n = trace[n];
  }
  for (int i = ans.size() - 1, _b = (0); i >= _b; i--) cout << ans[i] << " ";
}
