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;
void f1(vector<int>& v, int x) {
  if (x > 1000000) {
    sort(v.begin(), v.end());
    return;
  }
  v.push_back(x);
  f1(v, x * 10);
  f1(v, x * 10 + 1);
}
void fun(int n) {
  vector<int> v;
  f1(v, 1);
  int dp[n + 1], a[n + 1];
  memset(dp, 1000000, sizeof(dp));
  memset(a, -1, sizeof(a));
  dp[0] = 0;
  for (int i = 0; i < v.size(); i++) {
    for (int j = v[i]; j <= n; j++) {
      if (dp[j] > dp[j - v[i]] + 1) {
        dp[j] = dp[j - v[i]] + 1;
        a[j] = v[i];
      }
    }
  }
  vector<int> v1;
  while (a[n] != -1) {
    v1.push_back(a[n]);
    n -= a[n];
  }
  cout << v1.size() << endl;
  for (int i = 0; i < v1.size(); i++) {
    cout << v1[i] << " ";
  }
  return;
}
int main() {
  int n;
  cin >> n;
  fun(n);
  return 0;
}
