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<long int> v, v1;
long int i, j, n, m, ans, mx = -1, mn, sm, p, q, k, r;
int main() {
  v.push_back(1);
  v.push_back(10);
  i = 0;
  while (1) {
    p = v[i] * 10 + 0;
    if (p != 10) v.push_back(p);
    p = v[i] * 10 + 1;
    if (p != 10) v.push_back(p);
    i++;
    if (p > 1000005) break;
  }
  scanf("%d", &n);
  r = n;
  sm = 0;
  int cnt = 0;
  while (1) {
    cnt++;
    if (sm == r) break;
    for (i = 0; i < v.size(); i++) {
      if (v[i] > n) {
        m = v[i - 1];
        break;
      } else if (v[i] == n) {
        m = v[i];
        break;
      }
    }
    q = n / m;
    for (i = 0; i < q; i++) {
      v1.push_back(m);
      sm += m;
    }
    n = n - (q * m);
  }
  cout << v1.size() << endl;
  for (i = 0; i < v1.size(); i++) cout << v1[i] << " ";
  return 0;
}
