Contest Duration: - (local time) (100 minutes) Back to Home
A - Move Right /

Time Limit: 2 sec / Memory Limit: 1024 MB

### 問題文

Si 文字目が 1 であるとき、左から i 番目のマスには 1 人の人がおり、
Si 文字目が 0 であるとき、左から i 番目のマスには人がいません。

### 制約

• S0, 1 のみからなる長さ 4 の文字列

### 入力

S


### 入力例 1

1011


### 出力例 1

0101


### 入力例 2

0000


### 出力例 2

0000


### 入力例 3

1111


### 出力例 3

0111


Score : 100 points

### Problem Statement

There are 4 squares lined up horizontally.

You are given a string S of length 4 consisting of 0 and 1.
If the i-th character of S is 1, there is a person in the i-th square from the left;
if the i-th character of S is 0, there is no person in the i-th square from the left.

Now, everyone will move to the next square to the right simultaneously. By this move, the person who was originally in the rightmost square will disappear.

Determine if there will be a person in each square after the move. Print the result as a string in the same format as S. (See also Sample Input / Output for clarity.)

### Constraints

• S is a string of length 4 consisting of 0 and 1.

### Input

Input is given from Standard Input in the following format:

S


### Output

Print a string of length 4 such that the i-th character is 1 if there will be a person in the i-th square from the left after the move, and 0 otherwise.

### Sample Input 1

1011


### Sample Output 1

0101


After the move, the person who was originally in the 1-st square will move to the 2-nd square,
the person in the 3-rd square to the 4-th square,
and the person in the 4-th square will disappear.

### Sample Input 2

0000


### Sample Output 2

0000


### Sample Input 3

1111


### Sample Output 3

0111