You are given a number that consists of $n$ digits between 1 and 9. Your task is to remove exactly one digit so that the resulting number is as large as possible.

Input

The only input line contains the number.

Output

Output the maximum number after removing one digit.

Constraints

• $2 \le n \le 10^5$

Example

Input:

352

Output:

52

Input:

777757

Output:

77777