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;
const int N = 1e6 + 5, MOD = 1e9 + 7;
int n;
vector<int> v, ans, v2, dp[N];
void solve(int n) {
  vector<int> v1;
  int pi = n;
  int ret = 0;
  while (pi != 0) {
    ret = max(ret, pi % 10);
    v1.push_back(pi % 10);
    pi /= 10;
  }
  reverse(v1.begin(), v1.end());
  cout << ret << endl;
  for (int j = 0; j < ret; j++) {
    int num = 0;
    for (int i = 0; i < (int)v1.size(); i++) {
      num = num * 10;
      if (v1[i] > 0) {
        num++;
        v1[i]--;
      }
    }
    cout << num << " ";
  }
  cout << endl;
}
int main() {
  std::ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n;
  solve(n);
}
