[CodeForces-259C] Little Elephant and Bits-优快云博客

本文介绍了一个使用C++解决的小象删数问题，该问题要求在删除一个二进制数字后得到最大的可能数值。文章提供了一个简洁的代码示例，通过扫描输入的二进制字符串并寻找第一个0来实现目标，如果全是1，则删除最后一个数字。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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 105digits.

Output

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

Examples

input

Copy

output

Copy

input

Copy

output

Copy

Note

In the first sample the best strategy is to delete the second digit. That results in number 112 = 310.

In the second sample the best strategy is to delete the third or fourth digits — that results in number 110102 = 2610.

#include<bits/stdc++.h>
#define N 100005
using namespace std;
typedef long long ll;
int main(){
    char a[N];
    int flag=-1;
    cin>>a;
    int len=strlen(a);
    for(int i=0;i<len;i++){
        if(a[i]=='0'){

            flag=i;
            break;
        }
    }
    if(flag==-1)flag=len-1;
    for(int i=0;i<len;i++)
    {
        if(flag==i)continue;
        cout<<a[i];

    }

    return 0;
}