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 CountDigit(long long n) {
  if (n == 0)
    return 0;
  else
    return 1 + CountDigit(n / 10);
}
void printquassi(int n) {
  long divider = pow(10, CountDigit(n) - 1) + 0.5;
  vector<long> vec(n / divider, divider);
  long reminder = n;
  long size = vec.size();
  for (int i = 0; i < CountDigit(n) - 1; i++) {
    long lastreminder = reminder;
    long lastdivider = divider;
    reminder = reminder % divider;
    divider = pow(10, CountDigit(reminder) - 1) + 0.5;
    if (reminder > 0 && reminder < 10) {
      if (reminder - size > 0) {
        for (int i = 0; i < size; i++) vec[i] = vec[i] + 1;
        for (int i = 0; i < reminder - size; i++) vec.push_back(1);
      } else {
        for (int i = 0; i < reminder; i++) vec[i] = vec[i] + 1;
      }
      break;
    }
    if (reminder == 0) {
      for (int i = 0; i < lastreminder / lastdivider; i++)
        vec.push_back(lastdivider);
      break;
    }
    if (reminder >= 10) {
      for (int i = 0; i < (reminder / divider); i++) {
        vec[i] = vec[i] + divider;
      }
      size = vec.size();
      if ((reminder / divider) - size > 0) {
        for (int i = 0; i < (reminder / divider) - size; i++)
          vec.push_back(divider);
      }
    }
    if (reminder % divider == 00) break;
  }
  cout << vec.size() << endl;
  for (int i = 0; i < vec.size(); i++) cout << vec[i] << ' ';
  cout << endl;
}
int main() {
  long long n;
  cin >> n;
  if (n == 0) {
    cout << 0 << endl;
    cout << 0 << endl;
    return 0;
  }
  if (CountDigit(n) == 1) {
    cout << n << endl;
    for (int i = 0; i < n; i++) {
      cout << 1 << ' ';
    }
    return 0;
  }
  printquassi(n);
}
