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>
const int inf = 1e9;
const int mod = (int)1e9 + 7;
using namespace std;
template <class T>
void smin(T& a, T val) {
  if (a > val) a = val;
}
template <class T>
void smax(T& a, T val) {
  if (a < val) a = val;
}
const int N = 1e6 + 10;
int n;
vector<int> v;
bool is_binary(int n) {
  bool good = 1;
  while (n) {
    int d = n % 10;
    good &= (d == 0 or d == 1);
    n /= 10;
  }
  return good;
}
int dp[N];
int solve(int N) {
  if (N < 0) {
    return inf;
  }
  if (N == 0) {
    return 0;
  }
  int& ans = dp[N];
  if (~ans) return ans;
  ans = inf;
  for (int i = 0; i < (int)(v.size()); ++i) {
    if (v[i] > N) break;
    smin(ans, 1 + solve(N - v[i]));
  }
  return ans;
}
vector<int> path;
void trace(int N) {
  if (N < 0) {
    return;
  }
  if (N == 0) {
    return;
  }
  int ans = solve(N);
  for (int i = 0; i < (int)(v.size()); ++i) {
    if (v[i] > N) break;
    if (ans == 1 + solve(N - v[i])) {
      trace(N - v[i]);
      path.push_back(v[i]);
      return;
    }
  }
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  for (int i = 1; i < N; ++i) {
    if (is_binary(i)) {
      v.push_back(i);
    }
  }
  int n;
  cin >> n;
  memset(dp, -1, sizeof dp);
  cout << solve(n) << '\n';
  trace(n);
  for (auto it : path) cout << it << ' ';
  return 0;
}
