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;
vector<int> gen;
int dp[1000003];
int save[1000003];
void gener(int n, int t = 5) {
  gen.push_back(n);
  if (t == 0) {
    return;
  }
  gener(10 * n, t - 1);
  gener(10 * n + 1, t - 1);
}
void print(int n) {
  if (n == save[n]) {
    cout << n << " ";
    return;
  }
  cout << n - save[n] << " ";
  print(save[n]);
}
int main() {
  gener(1);
  sort(gen.begin(), gen.end());
  int n;
  cin >> n;
  int i, j;
  for (i = 1; i <= n; i++) dp[i] = 10000000;
  for (i = 1; i <= n; i++) {
    for (j = 0; j <= 34; j++) {
      if (gen[j] > i) break;
      if (gen[j] == i) dp[i] = 1, save[i] = i;
      if (dp[i - gen[j]] + 1 < dp[i])
        dp[i] = dp[i - gen[j]] + 1, save[i] = i - gen[j];
    }
  }
  cout << dp[n] << "\n";
  print(n);
  return 0;
}
