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 mod = 1e9 + 7;
const int maxn = 1e6 + 200;
int n_cnt(int x) {
  int t = x, cnt = 0;
  while (t % 10) {
    cnt++;
    t /= 10;
  }
  return cnt;
}
int bfs(int x) {
  int ma = 0;
  queue<int> Q;
  Q.push(1);
  while (Q.size()) {
    int a = Q.front();
    Q.pop();
    if (ma < a) ma = a;
    if (a * 10 <= x) Q.push(a * 10);
    if (a * 10 + 1 <= x) Q.push(a * 10 + 1);
  }
  return ma;
}
int ary[maxn];
int main() {
  int n, len = 0;
  cin >> n;
  while (n) {
    int ans = bfs(n);
    n -= ans;
    ary[len++] = ans;
  }
  cout << len << endl;
  for (int i = 0; i < len; i++)
    printf("%d%c", ary[i], i == len - 1 ? '\n' : ' ');
  return 0;
}
