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> v;
vector<int> answ;
void binary(int x) {
  int a = 0, i = 0;
  while (x != 1) {
    a += (x % 2) * pow(10, i);
    x /= 2;
    i++;
  }
  a += pow(10, i);
  v.push_back(a);
}
int calc(int n, int x, int y) {
  int l = 0, a;
  for (int i = x; i >= 0; i--) {
    a = n / v[i];
    l += a;
    if (y == 1)
      for (int j = 1; j <= a; j++) answ.push_back(v[i]);
    n = n - a * v[i];
  }
  return l;
}
int main() {
  ios::sync_with_stdio(0);
  for (int i = 1; i <= 64; i++) binary(i);
  int n, a, ans = 0, min = 100000000, imin, nn;
  cin >> n;
  for (int i = 0; i < (int)v.size(); i++) {
    if (v[i] > n) break;
    a = calc(n, i, 0);
    if (a < min) {
      min = a;
      imin = i;
    }
  }
  ans = calc(n, imin, 1);
  cout << ans << endl;
  for (int i = 0; i < (int)answ.size(); i++) cout << answ[i] << " ";
  cout << endl;
  return 0;
}
