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" $\rightarrow$ "100210"; -  "010210" $\rightarrow$ "001210"; -  "010210" $\rightarrow$ "010120"; -  "010210" $\rightarrow$ "010201". 
Note than you cannot swap "02" $\rightarrow$ "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 \le i \le |a|$, where $|s|$ is the length of the string $s$) such that for every $j &lt; i$ holds $a_j = b_j$, and $a_i &lt; b_i$.
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).
100210
001120
11222121
11112222
20
20
1002
0012
10
01
000021
000012
021
012
2
2
201
120
2112120
1112220
102
012
202
202
220201
122020
12
12
100022202
000122202
01
01
1
1
from collections import Counter


def main():
    s = [c for c in input().strip()]
    n = len(s)
    start = 0
    cnt = Counter()
    found2 = False
    for i in range(n):
        cnt[s[i]] += 1
        if s[i] == '2':
            found2 = True
        if s[i] == '0' and found2:
            cnt['2'] -= 1
            cnt['0'] -= 1
            replaced_str = ['0'] * cnt['0']
            replaced_str += ['1'] * cnt['1']
            replaced_str += ['2'] * cnt['2']
            replaced_str += ['2', '0']
            s[start:i + 1] = replaced_str
            start = i + 1
            found2 = False
            cnt = Counter()

    s[start:n] = ['0'] * cnt['0'] + ['1'] * cnt['1'] + ['2'] * cnt['2']

    print(''.join(s))


if __name__ == "__main__":
    main()