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;
const long long mod = 1000000007;
const int dx[] = {0, 1, -1, 0};
const int dy[] = {1, 0, 0, -1};
long long gcd(long long a, long long b) {
  if (b == 0) {
    return a;
  }
  return gcd(b, a % b);
}
long long fast_power(long long base, long long power) {
  long long res = 1;
  while (power) {
    if (power & 1) res = (res * base) % mod;
    base = (base * base) % mod;
    power /= 2;
  }
  return (res % mod);
}
void in_out_txt() {
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
}
vector<int> vec;
void fll() {
  vec.push_back(1);
  vec.push_back(10);
  vec.push_back(11);
  int i = 1, j = 1, s = 3, x = 0;
  while (j < 5) {
    j++;
    while (i < s) {
      vec.push_back(vec[i] * 10);
      vec.push_back(vec[i] * 10 + 1);
      x++;
      i++;
    }
    s = vec.size();
  }
  vec.push_back(1000000);
}
int n;
int mem[1000000 + 1][65];
int solve(int sum, int ind) {
  if (sum == n) return 0;
  int p = 1e8, p2;
  int &ret = mem[sum][ind];
  if (ret != -1) return ret;
  ret = 1e8;
  for (int i = ind; i < vec.size(); i++) {
    if (vec[i] + sum <= n) ret = min(ret, solve(vec[i] + sum, i) + 1);
  }
  return ret;
}
void print_(int sum, int ind) {
  if (sum == n) return;
  int p, p2;
  for (int i = ind; i < vec.size(); i++) {
    if (vec[i] + sum <= n) {
      p = solve(sum, ind);
      if (p == mem[sum][ind]) {
        cout << vec[i] << " ";
        print_(vec[i] + sum, i);
        break;
      }
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  fll();
  memset(mem, -1, sizeof mem);
  cin >> n;
  reverse(vec.begin(), vec.end());
  int co = solve(0, 0);
  cout << co << endl;
  print_(0, 0);
  return 0;
}
