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>
int mod = pow(10, 9) + 7;
using namespace std;
struct ans {
  long long a;
  vector<long long> b;
};
void fill(long long start, long long end, long long dig, vector<long long>& v) {
  for (long long i = start; i < end; ++i) {
    v.push_back(v[i] * 10 + 0);
    v.push_back(v[i] * 10 + 1);
  }
  return;
}
int main() {
  long long n;
  cin >> n;
  vector<long long> v;
  v.push_back(1);
  v.push_back(10);
  v.push_back(11);
  for (int i = 3; i <= 6; ++i) {
    fill(pow(2, i - 2) - 1, pow(2, i - 1) - 1, i, v);
  }
  v.push_back(1000000);
  ans* arr = new ans[1000000];
  arr[0].a = 0;
  arr[1].a = 1;
  arr[1].b.push_back(1);
  for (long long cur = 2; cur <= 1000000; ++cur) {
    arr[cur].a = INT_MAX;
    int vcur = 0;
    while (v[vcur] <= cur && vcur < v.size()) {
      if (arr[cur - v[vcur]].a + 1 < arr[cur].a) {
        arr[cur].a = arr[cur - v[vcur]].a + 1;
        arr[cur].b = arr[cur - v[vcur]].b;
        arr[cur].b.push_back(v[vcur]);
      }
      ++vcur;
    }
  }
  cout << arr[n].a << endl;
  for (int i = 0; i < arr[n].b.size(); ++i) {
    cout << arr[n].b[i] << " ";
  }
}
