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;
  cin >> n;
  string temp;
  vector<string> quasi;
  for (int mask = 1; mask < (1 << 21); mask++) {
    if (mask > 10 * n) break;
    temp = "";
    for (int i = 21; i >= 0; i--) {
      if (mask & (1 << i)) {
        temp += "1";
      } else
        temp += "0";
    }
    quasi.push_back(temp);
  }
  sort(quasi.begin(), quasi.end());
  int ans = 0;
  vector<int> comps;
  int idx = (int)quasi.size() - 1;
  while (n > 0) {
    long long int num = atol(quasi[idx].c_str());
    if ((n - num) >= 0) {
      ans += 1;
      n -= num;
      comps.push_back(num);
    } else
      idx -= 1;
  }
  cout << ans << endl;
  for (int i = 0; i < (int)comps.size(); i++) {
    cout << comps[i] << " ";
  }
  cout << endl;
  return 0;
}
