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.*;
import java.lang.reflect.Array;
import java.net.Inet4Address;
import java.nio.ByteBuffer;
import java.util.*;
public class test {
    int max = 0;
    long t[];
    boolean visited[];
    ArrayList<Integer> queue = new ArrayList<>();

    public static void main(String args[]) throws IOException {
        test obj = new test();
        obj.start();
    }

    void start() throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        PrintStream out = System.out;
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        // int k=sc.nextInt();
        while(n!=0)
        {
            StringBuilder s=new StringBuilder(n+"");
            for(int i=0;i<s.length();i++)
            if(s.charAt(i)!='0')
                s.setCharAt(i,'1');
            out.print(s+" ");
            n-=Integer.parseInt(String.valueOf(s));
        }

    }

    //<---------------------------------------------------------------------------------------------------------------->//

     // to create and initialize Integer array
    private int[] intArray(int a, Scanner sc) {
        int temp[]=new int[a];
        for(int i=0;i<a;i++) {
            temp[i]=sc.nextInt();
        }
        return temp;
    }
    // to create and initialize Long Array
    private long[] longArray(int a, Scanner sc) {
        long temp[]=new long[a];
        for(int i=0;i<a;i++) {
            temp[i]=sc.nextLong();
        }
        return temp;
    }

    // displaying Map contents key--value
    public static void printMap(Map mp) {
        Iterator it = mp.entrySet().iterator();
        while (it.hasNext()) {
            Map.Entry pair = (Map.Entry)it.next();
            System.out.println(pair.getKey() + " = " + pair.getValue());
            it.remove(); // avoids a ConcurrentModificationException
        }
    }


    // Return arrayList of minimum factor of number
    // 24= 2*2*2*3;
    private ArrayList<Integer> minFactor(int a) {
        ArrayList<Integer> obj=new ArrayList<>();
        for(int i=2;i<=a;i++)
        {
            while(a!=0&&a%i==0)
            {
                obj.add(i);
                a/=i;
            }
        }
        return obj;
    }


    // check whether the number is prime or not
    public static boolean isPrimeNumber(int i) {
        int factors = 0;
        int j = 1;

        while(j <= i)
        {
            if(i % j == 0)
            {
                factors++;
            }
            j++;
        }
        return (factors == 2);
    }

    // creating and initializing arrayList
    private void initArrayList(ArrayList<Integer>[] tempa) {
        for(int i=0;i<tempa.length;i++)
            tempa[i]=new ArrayList<>();
    }

    // return factorial contents as ArrayList
    private ArrayList<Integer> factdigit(int i)
    {
        ArrayList<Integer> temp=new ArrayList<>();
        for(int j=i;j>1;j--)
        {
            temp.add(j);
        }
        return temp;
    }
    private  void println(int a[])
    {
        for(int i=0;i<a.length;i++)
            System.out.print(a[i]+" ");
    }
}