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;
bool check(int n) {
  while (n) {
    int temp = n % 10;
    if (temp > 1) {
      return 0;
    }
    n = n / 10;
  }
  return 1;
}
vector<int> v;
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.precision(10);
  cout << fixed;
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    if (check(i)) {
      v.push_back(i);
    }
  }
  int *dp = new int[n + 1];
  int *prev = new int[n + 1];
  dp[0] = 0;
  for (int i = 1; i <= n; ++i) {
    dp[i] = n + 1;
  }
  for (int i = 1; i <= n; ++i) {
    for (int j = 0; j < v.size(); ++j) {
      if (i < v[j]) {
        break;
      }
      if (dp[i - v[j]] + 1 < dp[i]) {
        dp[i] = dp[i - v[j]] + 1;
        prev[i] = v[j];
      }
    }
  }
  queue<int> lis;
  while (n) {
    lis.push(prev[n]);
    n = n - prev[n];
  }
  cout << lis.size() << "\n";
  while (!lis.empty()) {
    cout << lis.front() << " ";
    lis.pop();
  }
  return 0;
}
