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.math.*;

public class Main {

    private static FastReader fr = new FastReader();
    private static Helper hp = new Helper();
    private static StringBuilder result = new StringBuilder();

    public static void main(String[] args) {
        Task solver = new Task();
        solver.solve();
    }

    static class Task {
        
        private ArrayList<Long> quasi = new ArrayList<>();
        private void buildQuasi(){
            int maxLen = 1;
            quasi.add(0L);
            quasi.add(1L);
            HashSet<Long> included = new HashSet<>();
            included.add(0L);
            included.add(1L);
            while(maxLen <= 6){
                ArrayList<Long> temp = new ArrayList<>();
                for (int k = 0; k<2; k++) {
                    for (int i = 0; i < quasi.size(); i++) {
                        StringBuilder s = new StringBuilder(String.valueOf(quasi.get(i)));
                        StringBuilder newS = new StringBuilder(s);
                        s.append(k);
                        Long val2 = Long.parseLong(s.toString());
                        if (!included.contains(val2)) {
                            included.add(val2);
                            temp.add(val2);
                        }
                        if (k == 1) {
                            newS.insert(0, k);
                            Long val1 = Long.parseLong(newS.toString());
                            if (!included.contains(val1)) {
                                included.add(val1);
                                temp.add(val1);
                            }
                        }
                    }
                }
                quasi.addAll(temp);
                maxLen++;
            }
        }

        public void solve() {
            buildQuasi();
            quasi.sort(Collections.reverseOrder());
            long amount = fr.ni();
            for (int i=0; i<quasi.size(); i++) {
                if(quasi.get(i) > amount) continue;
                amount -= quasi.get(i);
                if(amount < 0) amount += quasi.get(i);
                else{
                    result.append(quasi.get(i)).append(" ");
                    i--;
                }
                if(amount == 0) break;
            }
            System.out.println(result);
        }
    }

    static class Helper {
        public int[] ipArrInt(int n) {
            int[] arr = new int[n];
            for (int i = 0; i < n; i++)
                arr[i] = fr.ni();
            return arr;
        }

        public long[] ipArrLong(int n, int si) {
            long[] arr = new long[n];
            for (int i = si; i < n; i++)
                arr[i] = fr.nl();
            return arr;
        }
    }

    static class FastReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;
        private static PrintWriter pw;

        public FastReader() {
            reader = new BufferedReader(new InputStreamReader(System.in));
            pw = new PrintWriter(System.out);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int ni() {
            return Integer.parseInt(next());
        }

        public long nl() {
            return Long.parseLong(next());
        }

        public String rl() {
            try {
                return reader.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return null;
        }

        public int[] nextIntArr(int n) throws IOException {
            int[] arr = new int[n];
            for (int i = 0; i < arr.length; i++)
                arr[i] = fr.ni();
            return arr;
        }

        public void print(String str) {
            pw.print(str);
            pw.flush();
        }
    }
}