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 n, arr[100], br = 1, used[1000010], t, k, ans[10], dp[1000010], temp;
int main() {
  cin >> n;
  temp = n;
  arr[0] = 1;
  for (int i = 0; i < br; i++) {
    arr[br++] = arr[i] * 10;
    arr[br++] = arr[i] * 10 + 1;
    if (arr[br - 1] > 1000000) break;
  }
  for (int i = 0; i < br; i++) used[arr[i]] = 1;
  int pos = 0;
  while (arr[pos] < n) pos++;
  for (int i = 1; i <= n; i++) dp[i] = i;
  for (int i = 1; i <= pos; i++)
    for (int j = arr[i]; j <= n; j++) dp[j] = min(dp[j], dp[j - arr[i]] + 1);
  cout << dp[n] << endl;
  while (n > 0 && pos >= 0 && !used[n]) {
    if (n > arr[pos]) {
      if (dp[n - arr[pos]] < dp[temp])
        ans[t++] = arr[pos], n -= arr[pos];
      else if (dp[n - arr[pos]] == dp[temp]) {
        if (n - arr[pos] == 0)
          ans[t++] = arr[pos], n -= arr[pos];
        else
          pos--;
      } else
        pos--;
    } else
      pos--;
  }
  if (n > 0) ans[t++] = n;
  for (int i = t - 1; i >= 0; i--) cout << ans[i] << " ";
  cout << endl;
}
