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^5 digits.


-----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
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_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.

Difficulty: competition

Starter code:

Solutions:
x = input ()

flag = 0
s = 0

for each_item in x:
    if each_item == '0':
        if flag == 0:
            flag = 1;
            continue
        else:
            print (each_item, end = '')
    else:
        if (s == len (x) - 1 and flag == 0) :
            continue
        print (each_item, end = '')
    s = s + 1


t = input()
k = t.find('0')
print('1' * (len(t) - 1) if k < 0 else t[: k] + t[k + 1: ])

s=input()
if(s.count('0')==0):
    print(s[1:])
else:
    i=s.index('0')
    print(s[:i]+s[i+1:])

a = input()
b = a.find('0')
if b >= 0:
    print(a[:b] + a[b+1:])
else:
    print(a[1:])

binary = input()
index = binary.find('0')

if index != -1 :
    print(binary[:index] + binary[index + 1:])
else :
    print(binary[1:])

sa=input()
lo=[]
if '0' in sa:
    
    for char in sa:
        lo.append(char)
    for element in lo:
        if element=='0':
            lo.remove(element)
            break
    string=''
    for element in lo:
        string+=element
    print(string)
else:
    print(sa[1:])


s = input()
c = {'0': 0,'1':0}
for i in range(len(s)):
    c[s[i]] += 1
if c['0'] == 0 :
    print(s[1:])
else:
    out = ''
    x = s.index('0')
    print(s[:x] + s[x+1:])

a = input()
i0 = a.find('0')
print(a[:i0] + a[i0 + 1:] if i0 != -1 else a[1:])

n=input()
z=max(0,n.find('0'))
print(n[:z]+n[z+1:])



s=input()
x=len(s)

if set(s)=={'1'}:
    print(int(s[0:x-1]))
else :
    for i in range(len(s)):
        if s[i]!='0':
            continue
        else:
            s=s[0:i]+s[i+1:len(s)]
            print(int(s)) 
            break

import sys

l = sys.stdin.readline()

sz = len(l) - 1
temp = []

c = 0
for i in range(sz):
    if(l[i] == "0"):
        c = i
        break
    temp.append(l[i])
    
if(c == 0):
    print(l[1:])
    return
else:    
    for i in range(c + 1, sz):
        temp.append(l[i])
    
print("".join(temp))

s = input()
zero = -1

for i in range(len(s)):
	if s[i] == '0':
		zero = i
		break

if zero == -1:
	print(s[1:])
else:
	print(s[:zero] + s[zero+1:])

s = input()
f = True
try:
	idx = s.index('0')
	print(s[:idx] + s[idx + 1: ])
	f = False
except:
	pass
if f:
	print(s[1:])


a=input()
i=0
while i<len(a):
 if a[i]=='0':
  print(a[:i]+a[i+1:])
  break
 i+=1
 if i==len(a):print('1'*(len(a)-1))


from sys import stdin


def main():
    s = stdin.readline().strip()
    i = s.find('0')
    if i == -1:
        return s[:-1]
    else:
        return s[:i] + s[i + 1:]


print(main())


'''
Created on ١٢‏/١٢‏/٢٠١٤

@author: mohamed265
'''
'''
s = input()
n = len(s)
slon = ""
for i in range(1, n):
    if s[i] == '0' and s[i - 1] != '0':
        t = s[0:i] + s[i + 1:n]
        slon = max(slon, t)
if len(slon) != n - 1:
    slon = s[1:]
print(slon)

s = input()
n = len(s)
slon = ""
k = temp = 0
for i in range(1, n):
    if s[i] == '0':
        t = s[0:i] + s[i + 1:n]
        k = int(t, 2)
        print(t , k)
        if k > temp:
            temp = k
            slon = t
if len(slon) != n-1:
    slon = s[1:]
print(slon)
'''
s = input()
temp = s.find('0')
print(s[1:]) if temp == -1 else print(s[0:temp] + s[temp+1:])

n=(input())
i=0
while i<len(n)-1 and n[i]!='0':
    print(n[i],end='')
    i+=1
if n[i]=='0':
    j=i+1
    while j<len(n):
        print(n[j],end='')
        j+=1


# coding: utf-8
a = input()
pos = a.find('0')
if pos==-1:
    print(a[:-1])
else:
    print(a[:pos]+a[pos+1:])


s = list(input())
n = len(s)

for i in range(n):
	if(s[i] == '0'):
		s.pop(i)
		break

if(len(s) == n - 1):
	print(''.join(s))
else:
	print(''.join(s[0:n-1]))

b = input().strip()

p = b.find('0')

os = ''
if p != -1:
	os = b[:p] + b[p+1:]
else:
	os = b[1:]

print(os)

a = input()
idx = a.find('0')
print(a.replace(a[idx], '', 1))


3

s = list(input().strip())
for x in range(len(s)):
	if s[x] == '0':
		del s[x]
		break
	elif x == len(s)-1:
		del s[x]

print("".join(s))


f=input()
f=[int(x) for x in f]
def func():
    if f.count(1)==len(f):
        for i in f[:-1]:print(i,end='')
        return
    elif f.count(0)==len(f):
        print(0)
        return
    start=False
    j=-1
    for i in f:
        j+=1
        if start==False and i==0:
            continue
        start=True
        if i==0:
            j+=1
            break
        print(i,end='')
    while j<len(f):
        print(f[j],end='')
        j+=1

func()


#In the name of Allah

from sys import stdin, stdout
input = stdin.readline

a = input()[:-1]

dl = -1
for i in range(len(a)):
         if a[i] == "0":
                  dl = i
                  break

a = list(a)
a.pop(i)
stdout.write("".join(a))


bin = input()

ok = 1
for i in range(len(bin)):
    if bin[i] == '0':
        bin = bin[0:i] + bin[i + 1: len(bin)]
        ok = 0
        break

if ok == 1:
    bin = bin[0:-1]

print(bin)