#include <bits/stdc++.h>
using namespace std;
void f1(vector<int>& v, int x) {
  if (x > 1000000) {
    sort(v.begin(), v.end());
    return;
  }
  v.push_back(x);
  f1(v, x * 10);
  f1(v, x * 10 + 1);
}
void fun(int n) {
  vector<int> v;
  f1(v, 1);
  int dp[n + 1], a[n + 1];
  memset(dp, 1000000, sizeof(dp));
  memset(a, -1, sizeof(a));
  dp[0] = 0;
  for (int i = 0; i < v.size(); i++) {
    for (int j = v[i]; j <= n; j++) {
      if (dp[j] > dp[j - v[i]] + 1) {
        dp[j] = dp[j - v[i]] + 1;
        a[j] = v[i];
      }
    }
  }
  vector<int> v1;
  while (a[n] != -1) {
    v1.push_back(a[n]);
    n -= a[n];
  }
  cout << v1.size() << endl;
  for (int i = 0; i < v1.size(); i++) {
    cout << v1[i] << " ";
  }
  return;
}
int main() {
  int n;
  cin >> n;
  fun(n);
  return 0;
}
