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 B1009{

	private void solve() throws Exception {
		char[] chs = nextToken().toCharArray();
		int n = chs.length;
		int ones = 0;
		for(int i = 0; i < n; i++) if(chs[i] == '1') ones++;
		char[] res = new char[n];
		int idx = 0;
		int start = -1;
		for(int i = 0; i < n; i++) {
			if(chs[i] == '2') {
				if(start < 0) {
					start = idx;
					idx = idx+ones;
				}
				res[idx++] = chs[i];
			} else if(chs[i] == '0') res[idx++] = chs[i];
		}
		if(start < 0) start = idx;
		for(int j = start; j < start+ones; j++) res[j] = '1';
		out.println(new String(res));
	}

	
	
	public static void main(String[] args) {
		(new B1009()).run();
	}

	private BufferedReader in;
	private PrintWriter out;
	private StringTokenizer tokenizer;

	public void run() {
		try {
			in = new BufferedReader(new InputStreamReader(System.in));
			tokenizer = null;
			out = new PrintWriter(System.out);
			solve();
			in.close();
			out.close();
		} catch (Exception e) {
			e.printStackTrace();
			System.exit(1);
		}
	}

	private int nextInt() throws IOException {
		return Integer.parseInt(nextToken());
	}

	private long nextLong() throws IOException {
		return Long.parseLong(nextToken());
	}

	private float nextFloat() throws IOException {
		return Float.parseFloat(nextToken());
	}

	private String nextLine() throws IOException {
		return new String(in.readLine());
	}

	private String nextToken() throws IOException {
		while (tokenizer == null || !tokenizer.hasMoreTokens()) {
			tokenizer = new StringTokenizer(in.readLine());
		}
		return tokenizer.nextToken();
	}


}


class AVLTree<E extends Comparable<E>> {
	
	TreeNode<E> root;
	
	public void insert(E data) {
		root = insert(root, data);
	}
	
	public long countLessThan(E val) {
		return countLessThan(root, val);
	}
	
	public long countLessThan(TreeNode<E> node, E val) {
		if(node == null) return 0L;
		else if(val.compareTo(node.data) <= 0) return countLessThan(node.left, val);
		else return (node.left==null?0:node.left.size) + 1 + countLessThan(node.right, val);
	}

	private TreeNode<E> insert(TreeNode<E> node, E data){
		if(node == null) node = new TreeNode<E>(data);
		else if(data.compareTo(node.data) <= 0) node.left = insert(node.left, data);
		else node.right = insert(node.right, data);
		node.size = (node.left==null?0:node.left.size)+(node.right==null?0:node.right.size)+1;
		node = checkAVL(node);
		return node;
	}

	private TreeNode<E> checkAVL(TreeNode<E> node){
		if(node != null) {
			int balance = getBalance(node);
			if(balance < -1 || balance > 1) node = rotate(node, balance);
			update(node);
		}
		return node;
	}

	private TreeNode<E> rotate(TreeNode<E> node, int balance){
		if(balance < -1) {
			if(getBalance(node.left) <= 0) node = rotateLeftLeft(node);
			else node = rotateLeftRight(node);
		}else {
			if(getBalance(node.right) >= 0) node = rotateRightRight(node);
			else node = rotateRightLeft(node);
		}
		return node;
	}
	
	private TreeNode<E> rotateRightLeft(TreeNode<E> node) {
		TreeNode<E> pivot = node.right;
		TreeNode<E> root = pivot.left;
		pivot.left = root.right;
		node.right = root.left;
		root.right = pivot;
		root.left = node;
		update(pivot);
		update(node);
		return root;
	}

	private TreeNode<E> rotateRightRight(TreeNode<E> node) {
		TreeNode<E> root = node.right;
		node.right = root.left;
		root.left = node;
		update(node);
		return root;
	}

	private TreeNode<E> rotateLeftRight(TreeNode<E> node) {
		TreeNode<E> pivot = node.left;
		TreeNode<E> root = pivot.right;
		pivot.right = root.left;
		node.left = root.right;
		root.left = pivot;
		root.right = node;
		update(pivot);
		update(node);
		return root;
	}

	private TreeNode<E> rotateLeftLeft(TreeNode<E> node) {
		TreeNode<E> root = node.left;
		node.left = root.right;
		root.right = node;
		update(node);
		return root;
	}
	
	
	private void update(TreeNode<E> node) {
		if(node != null) {
			node.height = Math.max(getHeight(node.left), getHeight(node.right))+1;
			node.size = (node.left==null?0:node.left.size)+(node.right==null?0:node.right.size)+1;
		}
	}

	private int getBalance(TreeNode<E> node) {
		return getHeight(node.right) - getHeight(node.left);
	}
	
	private int getHeight(TreeNode<E> node) {
		return node != null? node.height : -1;
	}
		
}

class TreeNode<E extends Comparable<E>>{
	E data;
	int height;
	int size;
	TreeNode<E> left;
	TreeNode<E> right;
	
	public TreeNode(E data){
		this.data = data;
	}
}