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() {
  int n, k = 0, N;
  cin >> n;
  N = n;
  int mas[n], mas1[n];
  for (int i = 0; i < n; ++i) {
    int a = i;
    while (a > 0) {
      if (a % 10 == 1 || a & 10 == 0) {
        a = a / 10;
      } else {
        break;
      }
    }
    if (a == 0) {
      mas[i] = 1;
    } else {
      mas[i] = 0;
    }
    mas1[i] = 0;
  }
  for (int i = n - 1; i >= 0; --i) {
    if (i <= N && mas[i] == 1 && N != 0) {
      while (i <= N) {
        N -= i;
        mas1[i]++;
        k++;
      }
    }
  }
  cout << k << endl;
  for (int i = 0; i < n; ++i) {
    if (mas1[i] > 0) {
      while (mas1[i] > 0) {
        cout << i << " ";
        mas1[i] -= 1;
      }
    }
  }
  return 0;
}
