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.util.*;
import java.io.*;
import java.lang.*;
import java.math.*;

/**
 * Created by vishakha on 13-10-2016.
 */
public class ProblemHeeProblem {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();
        char ch = s.charAt(0);
        for (int i = 0; i < s.length(); i++) {
            ch = (char) Math.max(ch, s.charAt(i));
        }

        StringBuilder[] strings = new StringBuilder[Integer.parseInt(Character.toString(ch))];
        for (int i = 0; i < strings.length; i++) {
            strings[i] = new StringBuilder();
        }
//        System.out.println(Integer.parseInt(Character.toString(ch)));

        for (int i = 0; i < s.length(); i++) {
            int n = Integer.parseInt(Character.toString(s.charAt(i)));
            for (int j = 0; j < n; j++) {
                strings[j].append('1');
            }
            for (int j = n; j < strings.length; j++) {
                strings[j].append('0');
            }
        }
        for (StringBuilder sb : strings) {
            System.out.print(sb + " ");
        }
    }
}