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;
int MAX, num[70], idx, memo[int(1e6) + 2][66];
int solve();
void print_soloution(int, int);
void Generate(int);
int main() {
  cin >> MAX;
  Generate(0);
  sort(num, num + idx);
  cout << solve() << endl;
  print_soloution(MAX, idx - 1);
}
int solve() {
  for (int curr = 0; curr <= MAX; curr++) {
    for (int qidx = 0; qidx < idx; qidx++) {
      if (!curr)
        memo[curr][qidx] = 0;
      else if (!qidx)
        memo[curr][qidx] = int(1e8);
      else if (qidx == 1)
        memo[curr][qidx] = curr;
      else {
        int val = num[qidx];
        if (val <= curr)
          memo[curr][qidx] =
              min(memo[curr][qidx - 1], memo[curr - val][qidx] + 1);
        else
          memo[curr][qidx] = memo[curr][qidx - 1];
      }
    }
  }
  return memo[MAX][idx - 1];
}
void print_soloution(int curr, int qidx) {
  if (!curr || !qidx) return;
  int val = num[qidx];
  if (curr >= val && memo[curr][qidx - 1] >= memo[curr - val][qidx]) {
    cout << val << ' ';
    print_soloution(curr - val, qidx);
  } else
    print_soloution(curr, qidx - 1);
}
void Generate(int curr) {
  if (curr > MAX) return;
  num[idx++] = curr;
  if (curr) Generate(curr * 10);
  Generate(curr * 10 + 1);
}
