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;
int n, arr[100], br = 1, used[1000010], ans[1000000], t, k;
int main() {
  cin >> n;
  arr[0] = 1;
  for (int i = 0; i < br; i++) {
    arr[br++] = arr[i] * 10;
    if (arr[br - 1] > 1000000) break;
    arr[br++] = arr[i] * 10 + 1;
  }
  for (int i = 0; i < br; i++) used[arr[i]] = 1;
  int pos = 0;
  while (arr[pos] < n) pos++;
  bool f = 0;
  for (int i = pos; i > 0; i--) {
    if (n % arr[i] == 0) {
      f = 1;
      k = arr[i];
      break;
    }
  }
  if (f) {
    t = n / k;
    for (int i = 0; i < t; i++) ans[i] = k;
    n = 0;
  }
  while (!used[n] && n > 0) {
    if (n > arr[pos])
      n -= arr[pos], ans[t++] = arr[pos];
    else
      pos--;
  }
  if (n > 0) ans[t++] = n;
  cout << t << "\n";
  for (int i = 0; i < t; i++) cout << ans[i] << " ";
  cout << endl;
}
