A. Little Elephant and Bits

A. Little Elephant and Bits

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

Input

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

Output

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

Sample test(s)

Input

101

Output

11

Input

110010

Output

11010

Note

In the first sample the best strategy is to delete the second digit. That results in number 11₂ = 3₁₀.

In the second sample the best strategy is to delete the third or fourth digits — that results in number 11010₂ = 26₁₀.

题意为：将输入的2进制中删除其中一个，是它的十进制最大。

题解为：如果其中有0，就删除第一个0，如果都是1,，就随便删除一个。

code：

#include <iostream>
#include <string>
#define MAX 1000003
using namespace std;
int main()
{
	 char s[MAX];
	 string str;
	 int i,len,flag; 
	  while(cin>>s)
	  {
		  str=""; flag=1;
         len=strlen(s);
		
		 for(i=0;i<len;i++)
		 {          
			 if(s[i]=='0'&&flag)
			 {
				 flag=0;
			 }
			 else
                 str+=s[i];
		 }
		 if(flag)
			 cout<<s+1<<endl;
		 else
			 cout<<str<<endl;
	  }
	return 0;
}