Problem Description

You are given a binary string composed of $\text{'}0\text{'}$ and $\text{'}1\text{'}.$ Write a program to rearrange the string

such that all $\text{'}0\text{'}$s appear at the beginning, followed by all $\text{'}1\text{'}$s$.$

Input format

A single line containing a binary string $s(1|s|{10}^{{?}^{?}}3),$ where $|s|$ denotes the length of the

string.

Output format

A single line containing the rearranged binary string.

Sample Input $1$

$0101010101$

Sample Output $1$

$0000011111$

Explanation

The given binary string has five $\text{'}0\text{'}$s and five $\text{'}1\text{'}$s$.$ After rearranging, all $\text{'}0\text{'}$s are placed at the

beginning, followed by all $\text{'}1\text{'}$s$.$

Constraints

The input string consists only of $\text{'}0\text{'}$ and $\text{'}1\text{'}.$

The length of the input string is at least $1$ and at most ${10}^{{?}^{?}}3.$class MoveZeroesStringDSAJAVA$\{$ Scanner sc $=$ new Scanner$($System$.$in$)$; String result $=$ rearrangeBinaryString$($binaryString$)$;$\}\}$

$\}$