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

public class B implements Runnable{
	public static void main (String[] args) {new Thread(null, new B(), "_cf", 1 << 28).start();}

	public void run() {
		FastScanner fs = new FastScanner();
		PrintWriter out = new PrintWriter(System.out);
		System.err.println("Go!");

		char[] str = fs.next().toCharArray();
		int n = str.length;
		char[] res = new char[n];
		int left = 0;
		int[] fr = new int[3];
		TreeSet<Character> set = new TreeSet<>();
		for(int i = 0; i < n; i++) {
			set.add(str[i]);
			if(set.last()-set.first() == 2) {
				
				for(int j = left; j < i; j++) {
					fr[str[j]-'0']++;
				}
				int at = 0;
				for(int j = left; j < i; j++) {
					while(at < 3 && fr[at] == 0) at++;
					fr[at]--;
					res[j] = (char)(at+'0');
				}
				left = i;
				
				set.clear();
				set.add(str[i]);
			}
		}
		
		for(int j = left; j < n; j++) {
			fr[str[j]-'0']++;
		}
		int at = 0;
		for(int j = left; j < n; j++) {
			while(at < 3 && fr[at] == 0) at++;
			fr[at]--;
			res[j] = (char)(at+'0');
		}
		
		char[] nres = new char[n];
		int one = 0;
		for(char c : str) if(c == '1') one++;
		int skip = 0;
		at = 0;
		ArrayDeque<Character> dq = new ArrayDeque<>();
		for(char c : res) dq.addLast(c);
		while(!dq.isEmpty()) {
//			System.out.println(at + " " + dq);
			if(dq.peek() == '1' && skip > 0) {
				skip--;
				one--;
				dq.pollFirst();
				continue;
			}
			else if(dq.peek() == '0') {
				nres[at++] = dq.pollFirst();
			}
			else if(dq.peek() == '2') {
				if(one > 0) {
					one--;
					skip++;
					nres[at++] = '1';
				}
				else {
					nres[at++] = dq.pollFirst();
				}
			}
			else if(dq.peek() == '1') {
				nres[at++] = dq.pollFirst();
				one--;
			}
		}

		
		out.println(new String(nres));

		out.close();
	}

	void sort (int[] a) {
		int n = a.length;
		for(int i = 0; i < 50; i++) {
			Random r = new Random();
			int x = r.nextInt(n), y = r.nextInt(n);
			int temp = a[x];
			a[x] = a[y];
			a[y] = temp;
		}
		Arrays.sort(a);
	}

	class FastScanner {
		public int BS = 1<<16;
		public char NC = (char)0;
		byte[] buf = new byte[BS];
		int bId = 0, size = 0;
		char c = NC;
		double num = 1;
		BufferedInputStream in;

		public FastScanner() {
			in = new BufferedInputStream(System.in, BS);
		}

		public FastScanner(String s) throws FileNotFoundException {
			in = new BufferedInputStream(new FileInputStream(new File(s)), BS);
		}

		public char nextChar(){
			while(bId==size) {
				try {
					size = in.read(buf);
				}catch(Exception e) {
					return NC;
				}                
				if(size==-1)return NC;
				bId=0;
			}
			return (char)buf[bId++];
		}

		public int nextInt() {
			return (int)nextLong();
		}

		public long nextLong() {
			num=1;
			boolean neg = false;
			if(c==NC)c=nextChar();
			for(;(c<'0' || c>'9'); c = nextChar()) {
				if(c=='-')neg=true;
			}
			long res = 0;
			for(; c>='0' && c <='9'; c=nextChar()) {
				res = (res<<3)+(res<<1)+c-'0';
				num*=10;
			}
			return neg?-res:res;
		}

		public double nextDouble() {
			double cur = nextLong();
			return c!='.' ? cur:cur+nextLong()/num;
		}

		public String next() {
			StringBuilder res = new StringBuilder();
			while(c<=32)c=nextChar();
			while(c>32) {
				res.append(c);
				c=nextChar();
			}
			return res.toString();
		}

		public String nextLine() {
			StringBuilder res = new StringBuilder();
			while(c<=32)c=nextChar();
			while(c!='\n') {
				res.append(c);
				c=nextChar();
			}
			return res.toString();
		}

		public boolean hasNext() {
			if(c>32)return true;
			while(true) {
				c=nextChar();
				if(c==NC)return false;
				else if(c>32)return true;
			}
		}
		
		public int[] nextIntArray(int n) {
			int[] res = new int[n];
			for(int i = 0; i < n; i++) res[i] = nextInt();
			return res;
		}
		
	}

}