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>
int toMagic(int x) {
  std::string binary;
  while (x > 0) {
    binary.append(std::to_string(x & 1));
    x >>= 1;
  }
  return std::stod(std::string(binary.rbegin(), binary.rend()));
}
int main(int argc, char** argv) {
  std::ios_base::sync_with_stdio(false);
  int n;
  std::cin >> n;
  std::set<int> magicNumbers;
  std::vector<std::vector<int> > dp(n + 1, std::vector<int>());
  for (int i = 1; i < 65; ++i) {
    magicNumbers.insert(toMagic(i));
  }
  for (int i = 1; i <= n; ++i) {
    for (auto item : magicNumbers) {
      if (item > i) {
        break;
      }
      if ((dp[i - item].size() < dp[i].size()) || (dp[i].size() == 0)) {
        dp[i] = dp[i - item];
        dp[i].push_back(item);
      }
    }
  }
  std::cout << dp[n].size() << std::endl;
  for (int i = 0; i < dp[n].size(); ++i)
    std::cout << dp[n][i] << ((i == (dp[n].size() - 1)) ? "\n" : " ");
  return 0;
}
