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 tr[10], ar[1000005];
int main() {
  int n, sum;
  int len = 0;
  cin >> n;
  tr[1] = n % 10, tr[2] = (n / 10) % 10, tr[3] = (n / 100) % 10,
  tr[4] = (n / 1000) % 10, tr[5] = (n / 10000) % 10, tr[6] = (n / 100000) / 10,
  tr[7] = n / 1000000;
  while (tr[1] || tr[2] || tr[3] || tr[4] || tr[5] || tr[6] || tr[7]) {
    sum = 0;
    if (tr[1] > 0) {
      sum += 1;
      tr[1]--;
    }
    if (tr[2] > 0) {
      sum += 10;
      tr[2]--;
    }
    if (tr[3] > 0) {
      sum += 100;
      tr[3]--;
    }
    if (tr[4] > 0) {
      sum += 1000;
      tr[4]--;
    }
    if (tr[5] > 0) {
      sum += 10000;
      tr[5]--;
    }
    if (tr[6] > 0) {
      sum += 100000;
      tr[6]--;
    }
    if (tr[7] > 0) {
      sum += 1000000;
      tr[7]--;
    }
    ar[++len] = sum;
  }
  sort(ar + 1, ar + 1 + len);
  cout << ar[1];
  for (int i = 2; i <= len; i++) cout << ' ' << ar[i];
  cout << endl;
}
