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

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;

public class Something {

    public static void main(String[] args) throws IOException {

        BufferedReader r = new BufferedReader(new InputStreamReader(System.in));
        String num = r.readLine();
        int maxN = Integer
                .parseInt(Collections.max(Arrays.asList(num.split(""))));
        int lenght = num.length();
        int i = 0;
        int ar[] = new int[lenght];

        String res = "";

        for (String s : num.split(""))
            ar[i++] = Integer.parseInt(s);

        for (int k = 0; k < maxN; ++k) {
            String s = "";
            for (int j = 0; j < lenght; ++j)
                if (ar[j] != 0) {
                    --ar[j];
                    s += 1;
                } else
                    s += 0;

            int f = Integer.parseInt(s);
            res += f + " ";
        }

        System.out.println(res.subSequence(0, res.length() - 1));
    }
}
