#include <bits/stdc++.h>
using namespace std;
vector<int> gen;
int dp[1000003];
int save[1000003];
void gener(int n, int t = 5) {
  gen.push_back(n);
  if (t == 0) {
    return;
  }
  gener(10 * n, t - 1);
  gener(10 * n + 1, t - 1);
}
void print(int n) {
  if (n == save[n]) {
    cout << n << " ";
    return;
  }
  cout << n - save[n] << " ";
  print(save[n]);
}
int main() {
  gener(1);
  gen.push_back(1000000);
  sort(gen.begin(), gen.end());
  int n;
  cin >> n;
  int i, j;
  for (i = 1; i <= n; i++) dp[i] = 10000000;
  for (i = 1; i <= n; i++) {
    for (j = 0; j < gen.size(); j++) {
      if (gen[j] > i) break;
      if (gen[j] == i) dp[i] = 1, save[i] = i;
      if (dp[i - gen[j]] + 1 < dp[i])
        dp[i] = dp[i - gen[j]] + 1, save[i] = i - gen[j];
    }
  }
  cout << dp[n] << "\n";
  print(n);
  return 0;
}
