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;
string start = "1";
vector<int> v;
void gen(string nw) {
  if (nw.length() > 6) return;
  v.push_back(stoi(nw));
  gen(nw + "0");
  gen(nw + "1");
}
long long int table[1000001];
int main() {
  ios::sync_with_stdio(false);
  cin.tie();
  cout.tie();
  string nw = start;
  gen(nw);
  int n;
  cin >> n;
  sort(v.begin(), v.end());
  vector<int> rad;
  fill(table, table + 1000001, INT_MAX);
  table[0] = 0;
  vector<int> ans;
  vector<int> path(1000001);
  for (int i = 1; i <= 1000000; ++i) {
    for (int j = 0; j < v.size(); ++j) {
      if (i - v[j] >= 0 && table[i - v[j]] + 1 < table[i]) {
        table[i] = table[i - v[j]] + 1;
        path[i] = i - v[j];
      }
    }
  }
  cout << table[n] << "\n";
  int yo = n;
  while (yo != 0) {
    cout << yo - path[yo] << " ";
    yo = path[yo];
  }
  return 0;
}
