Problem2273--Move Right

2273: Move Right

[Creator : ]
Time Limit : 1.000 sec  Memory Limit : 128 MB

Description

Time Limit: 2 sec / Memory Limit: 1024 MB

Score : 100100 points

Problem Statement

There are 44 squares lined up horizontally.
You are given a string SS of length 44 consisting of 0 and 1.
If the ii-th character of SS is 1, there is a person in the ii-th square from the left;
if the ii-th character of SS is 0, there is no person in the ii-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 SS. (See also Sample Input / Output for clarity.)

Constraints

  • SS is a string of length 44 consisting of 0 and 1.

Input

Input is given from Standard Input in the following format:
SS

Output

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

Sample Input Copy

1011

Sample Output Copy

0101

Source/Category