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;
bool isQuasi(int n) {
  while (n > 0) {
    if (n % 10 > 1) return false;
    n /= 10;
  }
  return true;
}
vector<int> quasi;
int dp[1000010];
int choise[1000010];
int doit(int n) {
  if (n == 0)
    return 0;
  else if (n < 0)
    return -10000000;
  if (dp[n] != 0) return dp[n];
  vector<int>::iterator e = upper_bound(quasi.begin(), quasi.end(), n), s;
  bool flag = false;
  for (s = quasi.begin(); s != e; s++) {
    int c = *s;
    int get = doit(n - c) + 1;
    if (!flag) {
      dp[n] = get;
      choise[n] = c;
      flag = true;
    } else if (dp[n] > get) {
      dp[n] = get;
      choise[n] = c;
    }
  }
  return dp[n];
}
void getAns(int n) {
  if (n == 0) return;
  cout << choise[n] << " ";
  getAns(n - choise[n]);
}
int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    if (isQuasi(i)) quasi.push_back(i);
    dp[i] = dp[i - 1] + 1;
    choise[i] = 1;
    for (int j = 1; j < quasi.size(); j++) {
      if (dp[i] > dp[i - quasi[j]] + 1) {
        dp[i] = dp[i - quasi[j]] + 1;
        choise[i] = quasi[j];
      }
    }
  }
  cout << dp[n] << endl;
  getAns(n);
  cout << endl;
}
