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 int N = 1e7 + 5;
int n, cnt, sum, a[N], c[N], F[N];
void Add() {
  int curr = 0;
  for (int i = 1; i <= 7; i++) curr = curr * 10 + c[i];
  cnt++, a[cnt] = curr;
}
void quasi(int i) {
  if (i > 7) {
    Add();
    return;
  }
  for (int j = 0; j <= 1; j++) {
    c[i] = j;
    quasi(i + 1);
  }
}
void Solve() {
  for (int i = 1; i <= n; i++) F[i] = 1e8;
  for (int i = 1; i <= cnt; i++) F[a[i]] = 1;
  for (int i = 1; i <= n; i++) {
    for (int j = 2; j <= cnt; j++) {
      if (a[j] <= i)
        F[i] = min(F[i], F[i - a[j]] + 1);
      else
        break;
    }
  }
  cout << F[n] << '\n';
  int t = n;
  for (int i = F[n] - 1; i >= 1; i--) {
    for (int j = 1; j <= cnt; j++) {
      if (F[t - a[j]] == i && n - a[j] >= 0) {
        cout << a[j] << " ";
        sum += a[j], t -= a[j];
        break;
      }
    }
  }
  cout << n - sum << '\n';
}
int main() {
  cin >> n;
  quasi(1);
  Solve();
  return 0;
}
