Little Elephant and Bits

题意翻译

给定一个二进制的整数(含前导0),求删去任意一位数之后最大的二进制整数(含前导0)

题目描述

The Little Elephant has an integer $ a $ , written in the binary notation. He wants to write this number on a piece of paper. To make sure that the number $ a $ fits on the piece of paper, the Little Elephant ought to delete exactly one any digit from number $ a $ in the binary record. At that a new number appears. It consists of the remaining binary digits, written in the corresponding order (possible, with leading zeroes). The Little Elephant wants the number he is going to write on the paper to be as large as possible. Help him find the maximum number that he can obtain after deleting exactly one binary digit and print it in the binary notation.

输入输出格式

输入格式


The single line contains integer $ a $ , written in the binary notation without leading zeroes. This number contains more than $ 1 $ and at most $ 10^{5} $ digits.

输出格式


In the single line print the number that is written without leading zeroes in the binary notation — the answer to the problem.

输入输出样例

输入样例 #1

101

输出样例 #1

11

输入样例 #2

110010

输出样例 #2

11010

说明

In the first sample the best strategy is to delete the second digit. That results in number $ 11_{2}=3_{10} $ . In the second sample the best strategy is to delete the third or fourth digits — that results in number $ 11010_{2}=26_{10} $ .