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.Scanner;


public class primos {
    public static void main (String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        String s = String.valueOf(n);

        boolean t = s.matches(".*[2-9].*");

        if(t){
            
            int[] u = new int[100];
            int[] d = new int[100];
            int[] c = new int[100];
            int[] um = new int[100];
            int[] dm = new int[100];
            int[] cm = new int[100];

            int iu =0;
            int id = 0;
            int ic = 0;
            int ium =0;
            int idm = 0;
            int icm = 0;

            while(n >0){
                if(n>=100000){
                    n = n - 100000;
                    cm[icm] = 100000;
                    icm++;

                }
                 else if(n>=10000){
                    n = n - 10000;
                    dm[idm] = 10000;
                    idm++;

                }
                else if(n>=1000){
                    n = n - 1000;
                    um[ium] = 1000;
                    ium++;

                }
                else if(n>=100){
                    n = n - 100;
                    c[ic] = 100;
                    ic++;

                }
                else if(n>=10){
                    n = n - 10;
                    d[id] = 10;
                    id++;

                }
                else if(n>=1){
                    n = n - 1;
                    u[iu] = 1;
                    iu++;

                }
            }

            int i = 0;
            int tot = 0;
            boolean band = true;
            while(band){
                tot += um[i];
                tot += dm[i];
                tot += cm[i];
                tot += u[i];
                tot += d[i];
                tot += c[i];

                if(tot==0) break;
                System.out.print(tot+" ");
                tot =0;
                i++;

            }


        }
        else{
            System.out.println(n);
        }


    }
}
