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;
map<long long int, long long int> mm;
long long int coins[65];
long long int minCoins(long long int m, long long int V) {
  long long int table[V + 1];
  table[0] = 0;
  for (long long int i = 1; i <= V; i++) table[i] = INT_MAX;
  for (long long int i = 1; i <= V; i++) {
    for (long long int j = 0; j < m; j++)
      if (coins[j] <= i) {
        long long int sub_res = table[i - coins[j]];
        if (sub_res != INT_MAX && sub_res + 1 < table[i]) {
          table[i] = sub_res + 1;
          mm[i] = coins[j];
        }
      }
  }
  return table[V];
}
int main() {
  long long int n;
  cin >> n;
  for (long long int i = 1; i <= 65; i++) {
    std::vector<long long int> v;
    long long int j = i;
    while (j > 0) {
      v.push_back(j % 2);
      j = j / 2;
    }
    reverse(v.begin(), v.end());
    long long int x = 0;
    for (long long int i = 0; i < v.size(); i++) x = x * 10 + v[i];
    coins[i - 1] = x;
  }
  long long int ans = minCoins(65, n);
  cout << ans << "\n";
  for (long long int i = 1; i <= ans; i++) {
    cout << mm[n] << " ";
    n = n - mm[n];
  }
  return 0;
}
