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 a[10000000];
int main() {
  int n, k = 0;
  cin >> n;
  if (n == 1000000) {
    a[k++] = n;
    n -= 1000000;
  }
  while (n > 100000) {
    a[k++] = 111111;
    n -= 111111;
  }
  if (n == 100000) {
    a[k++] = n;
    n -= 100000;
  }
  while (n > 10000) {
    a[k++] = 11111;
    n -= 11111;
  }
  if (n == 10000) {
    a[k++] = n;
    n -= 10000;
  }
  while (n > 1000) {
    a[k++] = 1111;
    n -= 1111;
  }
  if (n == 1000) {
    a[k++] = n;
    n -= 1000;
  }
  while (n > 100) {
    a[k++] = 111;
    n -= 111;
  }
  if (n == 100) {
    a[k++] = n;
    n -= 100;
  }
  while (n > 10) {
    a[k++] = 11;
    n -= 11;
  }
  if (n == 10) {
    a[k++] = n;
    n -= 10;
  }
  while (n < 10 && n > 0) {
    a[k++] = 1;
    n -= 1;
  }
  cout << k << endl;
  for (int i = 0; i < k; i++) cout << a[i] << " ";
  return 0;
}
