You are given a ternary string (it is a string which consists only of characters '0', '1' and '2').

You can swap any two adjacent (consecutive) characters '0' and '1' (i.e. replace "01" with "10" or vice versa) or any two adjacent (consecutive) characters '1' and '2' (i.e. replace "12" with "21" or vice versa).

For example, for string "010210" we can perform the following moves: 

  * "010210" → "100210"; 
  * "010210" → "001210"; 
  * "010210" → "010120"; 
  * "010210" → "010201". 



Note than you cannot swap "02" → "20" and vice versa. You cannot perform any other operations with the given string excluding described above.

You task is to obtain the minimum possible (lexicographically) string by using these swaps arbitrary number of times (possibly, zero).

String a is lexicographically less than string b (if strings a and b have the same length) if there exists some position i (1 ≤ i ≤ |a|, where |s| is the length of the string s) such that for every j < i holds a_j = b_j, and a_i < b_i.

Input

The first line of the input contains the string s consisting only of characters '0', '1' and '2', its length is between 1 and 10^5 (inclusive).

Output

Print a single string — the minimum possible (lexicographically) string you can obtain by using the swaps described above arbitrary number of times (possibly, zero).

Examples

Input

100210


Output

001120


Input

11222121


Output

11112222


Input

20


Output

20
import java.io.*;
import java.util.*;
import java.util.concurrent.TimeUnit;


public class Main {
    private final static long mod = 1000000007;

    private static void printArr2(long arr[][]) {

        int i, j, n = arr.length, m = arr[0].length;
        for (i = 0; i < n; i++) {
            for (j = 0; j < m; j++) {
                System.out.print(arr[i][j] + " ");
            }
            System.out.println();
        }
    }

    private static void printArr(int arr[][]) {
        int i, j, n = arr.length, m = arr[0].length;
        for (i = 0; i < n; i++) {
            for (j = 0; j < m; j++) {
                System.out.print(arr[i][j] + " ");
            }
            System.out.println();
        }
    }

    private static long power(long x, long y) {
        long temp;
        if (y == 0)
            return 1;
        temp = power(x, y / 2);
        temp = (temp * temp) % mod;
        if (y % 2 == 0)
            return temp;
        else
            return ((x % mod) * temp) % mod;
    }


    private static int gcd(int a, int b) {
        if (b == 0) return a;
        return gcd(b, a % b);
    }

    private static int cmp(Pair p, Pair q) {
        return p.sz == q.sz ? p.mt - q.mt : p.sz - q.sz;
    }

    static int nextPowerOf2(int n) {
        int count = 0;
        if (n > 0 && (n & (n - 1)) == 0)
            return n * 2;

        while (n != 0) {
            n >>= 1;
            count += 1;
        }

        return 1 << count;
    }
    static String isPrime(int n){
        int i;
        for(i=2;i*i<n;i++){
            if(n%i==0)return "Not prime";
        }
        return "Prime";
    }

    public static void main(String[] args) throws IOException {
        FastReader in = new FastReader();
        FastWriter out = new FastWriter();
        int t, i, j, k, r, l = 0,g, n, m = 0, x, y;
        long ans = 0, sum, d, cur, w, mx = -mod, mn = mod;
        //for (t = in.nextInt(); t > 0; t--)
        {
            String s=in.next();
            char c[]=s.toCharArray();
            n=s.length();
            for(i=0;i<n;i++){
                c[i]='0';
            }
            int lst2=n,c1=0;
            for(i=n-1;i>=0;i--){
                if(s.charAt(i)=='1'){
                    c1++;
                }
                if(s.charAt(i)=='2'){
                    lst2=i+c1;
                    c[i+c1]='2';
                }
            }
            for(i=lst2-1;i>=0&&c1>0;i--){
                c[i]='1';
                c1--;
            }
            out.println(new String(c));
        }
    }


    private static class Pair {
        int sz;
        int mt;

        public Pair(int sz, int mt) {
            this.sz = sz;
            this.mt = mt;
        }

        @Override
        public boolean equals(Object o) {
            if (this == o) return true;
            if (o == null || getClass() != o.getClass()) return false;
            Pair pair = (Pair) o;
            return sz == pair.sz &&
                    mt == pair.mt;
        }

        @Override
        public int hashCode() {

            return Objects.hash(sz, mt);
        }
    }

    static class FastReader {
        private BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        private StringTokenizer st;

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (Exception e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }

        int[] nextIntArr(int n) {
            int[] arr = new int[n];
            for (int i = 0; i < n; i++) {
                arr[i] = nextInt();
            }
            return arr;
        }

        long[] nextLongArr(int n) {
            long[] arr = new long[n];
            for (int i = 0; i < n; i++) {
                arr[i] = nextLong();
            }
            return arr;
        }

    }

    static class FastWriter {
        BufferedWriter bw;
        List<String> list = new ArrayList<>();
        Set<String> set = new HashSet<>();

        FastWriter() {
            bw = new BufferedWriter(new OutputStreamWriter(System.out));
        }

        <T> void print(T obj) throws IOException {
            bw.write(obj.toString());
            bw.flush();
        }

        void println() throws IOException {
            print("\n");
        }

        <T> void println(T obj) throws IOException {
            print(obj.toString() + "\n");
        }

        <T> void printArrLn(T[] arr) throws IOException {
            for (int i = 0; i < arr.length; i++) {
                print(arr[i] + " ");
            }
            println();
        }
        <T> void printListLn(List<T> arr) throws IOException {
            for (int i = 0; i < arr.size(); i++) {
                print(arr.get(i) + " ");
            }
            println();
        }

        void printCharN(char c, int n) throws IOException {
            for (int i = 0; i < n; i++) {
                print(c);
            }
        }
    }


}
