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.

Source: codeforces | Difficulty: EASY
Tags: Mathematics

Greedy algorithms


Solutions:
import sys
number = sys.stdin.readline()
printed = False
n_chars = len(number)
number = number[:n_chars - 1]
n_chars -= 1
for i in range(n_chars - 1):
	if number[i] == '0':
		print(number[:i] + number[i + 1:])
		printed = True
		break
if not printed:
	print(number[:n_chars - 1])


s = input()
n = len(s)
if '0' in s:
	s = list(s)
	s.pop(s.index('0'))
	s = ''.join(s)
else:
	s = s[1:]
print(s)


import math
mod = 1000000007

def power(a, b):
	res = 1
	b = b % (mod - 1)
	while b > 0:
		if b % 2 != 0:
			res = res % mod * (a % mod) % mod
		b = b // 2
		a = a % mod
		a = a * a % mod
	res = res % mod
	return res
a = input()
s = 0
n = len(a)
for i in range(n):
	if s == 0 and a[i] == '0':
		s = 1
		continue
	if s != 1 and i == n - 1:
		continue
	print(a[i], end='')


import sys
s = input()
for i in range(len(s)):
	if s[i] == '0':
		print(s[:i] + s[i + 1:])
		sys.exit(0)
print(s[:-1])


n = list(input())
if '0' in n:
	for i in range(len(n)):
		if n[i] == '0':
			n.remove(n[i])
			break
else:
	n.remove(n[0])
print(''.join(n))


from sys import stdin, stdout
import math
from itertools import permutations, combinations
from collections import defaultdict
from bisect import bisect_left
from bisect import bisect_right

def L():
	return list(map(int, stdin.readline().split()))

def In():
	return map(int, stdin.readline().split())

def I():
	return int(stdin.readline())
P = 1000000007
s = input()
mx = 0
if s == '1' * len(s):
	print('1' * (len(s) - 1))
elif s == '0' * len(s):
	print('0' * (len(s) - 1))
else:
	val = ''
	for i in range(len(s)):
		if s[i] == '0':
			st = s[0:i] + s[i + 1:]
			if int(st, 2) > mx:
				mx = int(st, 2)
				val = st
				break
	print(val)


n = list(input())
a = len(n)
if a == 1:
	print('0')
	quit()
for i in range(a):
	if n[i] == '0':
		n.pop(i)
		break
if a != len(n):
	print(int(''.join(n)))
else:
	n.pop(-1)
	print(int(''.join(n)))


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


def main():
	s = input()
	found = 0
	l = len(s)
	for i in range(l):
		if (s[i] == '0' or i == l - 1) and (not found):
			found = 1
			continue
		print(s[i], end='')
main()


s = str(input())
ans = ''
flag = 0
for i in range(len(s)):
	x = s[i]
	if not flag:
		if x == '1':
			flag = 1
		ans += x
	else:
		if x == '0' or i == len(s) - 1:
			ans += s[i + 1:]
			break
		ans += x
print(ans)


pal = input()
aux = ''
a = False
for i in range(0, len(pal)):
	if not a and pal[i] == '0':
		a = True
		continue
	aux = aux + pal[i]
if a:
	print(aux)
else:
	print(pal[0:len(pal) - 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


line = input()
a = 0
for i in range(len(line)):
	if line[i] == '0':
		line = line[:i] + line[i + 1:]
		a += 1
		break
if a == 0:
	line = line[:-1]
print(line)


s = input()
for i in range(len(s)):
	if s[i] == '0':
		break
if i != 0:
	ans = s[:i] + s[i + 1:]
else:
	ans = s[i + 1:]
print(ans)


binary_number = input()
index_to_remove = 0
for index in range(len(binary_number)):
	if binary_number[index] == '0':
		index_to_remove = index
		break
print(binary_number[:index] + binary_number[index + 1:])


def elephant(s):
	(pos1, pos2) = (s.find('0'), s.find('1'))
	if pos1 != -1:
		return s[:pos1] + s[pos1 + 1:]
	if pos1 == -1:
		return s[:pos2] + s[pos2 + 1:]
print(elephant(input()))


s = input()
firx = 0
while firx < len(s) and s[firx] != '0':
	firx += 1
if firx == len(s):
	print(s[1:])
else:
	print(s[:firx], end='')
	print(s[firx + 1:])


import sys
flag = True
bin_num = input()
bin_num = list(bin_num)
try:
	idx = bin_num.index('1')
except ValueError:
	print(0)
	sys.exit()
while bin_num[0] == '0':
	bin_num.remove('0')
	flag = False
try:
	if flag:
		bin_num.remove(bin_num[bin_num.index('0')])
except ValueError:
	if flag:
		bin_num.remove(bin_num[bin_num.index('1')])
bin_num = ''.join(bin_num)
print(bin_num)


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))


n = input()
if '0' in n:
	n = n.replace('0', '', 1)
else:
	n = n[:-1]
print(n)


idx = -1
str = input()
res = ''
siz = len(str)
for i in range(siz):
	if i == siz - 1:
		if idx != -1:
			res += str[i]
	elif str[i + 1] == '1' and str[i] == '0' and (idx == -1):
		idx = i
	else:
		res += str[i]
print(res)


x = input()
for i in x:
	if i == '0':
		x = x.replace(i, '', 1)
		print(x)
		break
else:
	print(x[1:])


s = str(input())
p = s.find('0')
if p != -1:
	s1 = s[0:p] + s[p + 1:]
	print(s1)
else:
	print(s[1:])


a = [i for i in input()]
if '0' in a:
	a.pop(a.index('0'))
	print(''.join(a))
else:
	a.pop()
	print(''.join(a))


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())


import sys, math, bisect
inf = float('inf')
mod = inf + 7

def lcm(a, b):
	return int(a / math.gcd(a, b) * b)

def gcd(a, b):
	return int(math.gcd(a, b))

def binarySearch(a, x):
	i = bisect.bisect_left(a, x)
	if i != len(a) and a[i] == x:
		return i
	else:
		return -1

def lowerBound(a, x):
	i = bisect.bisect_left(a, x)
	if i:
		return i - 1
	else:
		return -1

def upperBound(a, x):
	i = bisect.bisect_right(a, x)
	if i != len(a) + 1 and a[i - 1] == x:
		return i - 1
	else:
		return -1

def freq(a, x):
	z = upperBound(a, x) - lowerBound(a, x)
	if z <= 0:
		return 0
	return z
for _ in range(1):
	s = list(input())
	if '0' not in s:
		s = s[1:]
	else:
		for i in range(len(s)):
			if s[i] == '0':
				s[i] = '-1'
				break
	ans = ''
	for i in range(len(s)):
		if s[i] != '-1':
			ans += s[i]
	print(ans)


s = input()
n = len(s)
for i in range(n):
	if s[i] == '0':
		s = s[:i] + s[i + 1:]
		break
if len(s) == n:
	s = s[:n - 1]
print(s)


l = []
s = input()
n = len(s)
for i in range(n):
	l.append(s[i])
if l.count('0') == 0:
	print(s[:n - 1])
else:
	m = 0
	for i in range(n):
		if l[i] == '0':
			m = i
			break
	for i in range(len(l)):
		if i == m:
			continue
		print(l[i], end='')


n = list(input())
if '0' in n:
	n.pop(n.index('0'))
else:
	n.pop()
print(''.join(n))


n = input()
n2 = n
for i in range(len(n)):
	if n[i] == '0':
		n = n[:i] + n[i + 1:]
		break
if n == n2:
	print(n[1:])
else:
	print(n)


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


n = input()
s = list(n)
if '0' in s:
	s.remove('0')
else:
	s.remove('1')
print(''.join(s))


n = int(input())
x = list(map(int, str(n)))
f = 0
for i in range(len(x)):
	if x[i] == 0 and f == 0:
		f += 1
	elif i == len(x) - 1 and f == 0:
		dip = 'd'
	else:
		print(x[i], end='')


n = input()
c = 0
res = ''
for i in range(len(n)):
	if n[i] == '0' and c == 0:
		c += 1
	elif n[i] == '0' and c > 0:
		res += '0'
	elif n[i] == '1':
		res += '1'
	else:
		pass
l = len(res)
if c == 0:
	res = res[:l - 1]
print(res)


n = input()
st = ''
a = 0
for i in n:
	if i == '0' and a == 0:
		a = 1
		continue
	st = st + i
if a == 1:
	print(st)
else:
	print(st[1:])


n = input()
loc = n.find('0')
if loc == -1:
	ans = n[1:]
else:
	ans = n[:loc] + n[loc + 1:]
print(ans)


def R(i):
	for j in range(len(i)):
		if i[j] == '0':
			return i[:j] + i[j + 1:]
	return i[:-1]
print(R(input().strip()))


n = input()
n = list(n)
if '0' in n:
	n.remove('0')
else:
	n.remove('1')
m = ''.join(n)
print(m)


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


import os, sys

def read():
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('output.txt', 'w')
input = lambda : sys.stdin.readline().rstrip('\r\n')

def main():
	n = input()
	fl = 1
	for i in range(len(n)):
		if fl and (n[i] == '0' or i == len(n) - 1):
			fl = 0
			continue
		print(n[i], end='')
main()


s = input()
if '0' in s:
	print(s.replace('0', '', 1))
else:
	print(s.replace('1', '', 1))


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


s = input()
print(s.replace('0', '', 1) if s.count('0') > 0 else s[:-1])


n = int(input())
n = str(n)
if '0' not in n:
	print(n[1:])
else:
	print(n.replace('0', '', 1))


ll = lambda : map(int, input().split())
t = lambda : int(input())
ss = lambda : input()
lx = lambda x: map(int, input().split(x))

def f():
	s = list(ss())
	try:
		x = s.index('0')
		p = ''
		for i in range(len(s)):
			if i == x:
				continue
			p += s[i]
		print(p)
	except:
		print(''.join(s[:len(s) - 1]))
f()


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


def go():
	a = [i for i in input()]
	if '0' not in a:
		return ''.join(a[1:])
	for i in range(len(a)):
		if a[i] == '0':
			a[i] = None
			break
	return ''.join([i for i in a if i is not None])
print(go())


n = list(map(lambda x: str(x), input()))
if n.count('0'):
	n.remove('0')
else:
	n.pop()
print(''.join(n))


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


p = input()
p = p.replace('', ' ')
p = p.split()
c = 0
for i in range(p.index('1'), len(p)):
	if p[i] == '0':
		c = i
		break
for i in range(len(p)):
	if i == c:
		pass
	else:
		print(p[i], end='')


n = [str(i) for i in input()]
if '0' in n:
	n.remove('0')
	print(''.join((i for i in n)))
else:
	n.remove('1')
	print(''.join((i for i in n)))


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


n = list(input())
if n.count('0') != 0:
	a = n.index('0')
	n.pop(a)
	for i in range(len(n)):
		print(n[i], end='')
else:
	for i in range(1, len(n)):
		print(n[i], end='')


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


s = input()
n = len(s)
t = 0
q = -1
for i in range(n):
	if s[i] == '0':
		t = 1
		q = i
		break
for i in range(n):
	if t == 0 and i == n - 1:
		break
	if i != q:
		print(s[i], end='')


n = input()
lst = []
w = ''
for i in n:
	lst.append(i)
for j in lst:
	if j == '0':
		lst.remove(j)
		break
if len(lst) == len(n):
	print(n[:-1])
else:
	for k in lst:
		w = w + k
	print(w)


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


import sys

def solution(n):
	try:
		idx = n.index('0')
	except ValueError:
		return n[:-1]
	sol = n[:idx] + n[idx + 1:]
	return sol
n = sys.stdin.readline()
while n:
	print(solution(n.strip()))
	n = sys.stdin.readline()


s = input()
ans = []
flag = True
for i in s:
	if i == '0' and flag:
		flag = False
	else:
		ans.append(i)
if not flag:
	print(''.join(ans))
else:
	ans.pop()
	print(''.join(ans))


a = input()
b = a
for i in a:
	if i == '0':
		a = a[0:a.index(i)] + a[a.index(i) + 1:len(a)]
		break
if b == a:
	print(a[0:len(a) - 1])
else:
	print(a)


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


s = input()
s1 = list(s)
i = s.find('0')
s1.remove(s1[i])
s = ''.join(s1)
print(s)


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


from collections import deque
from math import ceil

def ii():
	return int(input())

def si():
	return input()

def mi():
	return map(int, input().split())

def li():
	return list(mi())
abc = 'abcdefghijklmnopqrstuvwxyz'
s = si()
n = len(s)
f = 0
b = []
for i in range(len(s)):
	if s[i] == '1':
		b.append(1)
	elif s[i] == '0' and f == 1:
		b.append(0)
	else:
		f = 1
if f == 0:
	for i in range(n - 1):
		print(b[i], end='')
	print()
else:
	for i in range(n - 1):
		print(b[i], end='')
	print()


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


a = list(input())
if '0' not in a:
	print('1' * (len(a) - 1))
else:
	for i in range(len(a)):
		if a[i] == '0':
			del a[i]
			break
	print(*a, sep='')


s = input()
firstzero = 0
leadingzero = True
for i in range(len(s)):
	if s[i] == '1':
		leadingzero = False
	if leadingzero == False and s[i] == '0':
		firstzero = i
		break
print(s[:firstzero] + s[firstzero + 1:])


a = list(input())
if '0' in a:
	del a[a.index('0')]
	print(''.join(a), sep='')
else:
	print(''.join(a[1:]), sep='')


s = input()
n = len(s)
z = 0
x = []
for i in range(0, n):
	if s[i] == '0':
		if z == 0:
			z = 1
		else:
			x.append(0)
	else:
		x.append(1)
if z == 0:
	x.pop(n - 1)
for i in range(0, n - 1):
	print(x[i], end='')


s = input()
for (i, v) in enumerate(s):
	if v == '0':
		break
s = s[0:i] + s[i + 1:]
print(s)


import bisect
import decimal
from decimal import Decimal
import os
from collections import Counter
import bisect
from collections import defaultdict
import math
import random
import heapq
from math import sqrt
import sys
from functools import reduce, cmp_to_key
from collections import deque
import threading
from itertools import combinations
from io import BytesIO, IOBase
from itertools import accumulate
decimal.getcontext().prec = 46

def primeFactors(n):
	prime = set()
	while n % 2 == 0:
		prime.add(2)
		n = n // 2
	for i in range(3, int(math.sqrt(n)) + 1, 2):
		while n % i == 0:
			prime.add(i)
			n = n // i
	if n > 2:
		prime.add(n)
	return list(prime)

def getFactors(n):
	factors = []
	i = 1
	while i <= math.sqrt(n):
		if n % i == 0:
			if n // i == i:
				factors.append(i)
			else:
				factors.append(i)
				factors.append(n // i)
		i = i + 1
	return factors

def SieveOfEratosthenes(n):
	prime = [True for i in range(n + 1)]
	p = 2
	while p * p <= n:
		if prime[p] == True:
			for i in range(p * p, n + 1, p):
				prime[i] = False
		p += 1
	num = []
	for p in range(2, n + 1):
		if prime[p]:
			num.append(p)
	return num

def lcm(a, b):
	return a * b // math.gcd(a, b)

def sort_dict(key_value):
	return sorted(key_value.items(), key=lambda kv: (kv[1], kv[0]))

def list_input():
	return list(map(int, input().split()))

def num_input():
	return map(int, input().split())

def string_list():
	return list(input())

def decimalToBinary(n):
	return bin(n).replace('0b', '')

def binaryToDecimal(n):
	return int(n, 2)

def solve():
	s = input()
	for i in range(len(s)):
		if s[i] == '0':
			print(s[:i] + s[i + 1:])
			return
	print(s[1:])
t = 1
for _ in range(t):
	solve()


s = input()
A = []
for i in s:
	A.append(i)
if len(set(s)) == 1:
	print(s[:-1])
else:
	for i in range(len(A)):
		if A[i] == '0':
			A.remove(A[i])
			break
	print(''.join(A))


s = input()
if '0' in s:
	k = s.index('0')
	s = s[:k] + s[k + 1:]
	print(s)
else:
	print(s[:-1])


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


n = input()
for i in range(len(n)):
	if n[i] == '0':
		print(n[:i] + n[i + 1:])
		exit()
print(n[:len(n) - 1])


n = input()
a = list(n)
i = x = 0
while i < len(a):
	if a[i] == '0':
		x = 1
		a.pop(i)
		break
	i += 1
if x:
	n = ''.join(a)
	print(n)
else:
	a.pop(0)
	n = ''.join(a)
	print(n)


import sys
n = sys.stdin.readline()
while n:
	if '0' not in n:
		print(n[:-2])
	else:
		for i in range(len(n)):
			if n[i] == '0':
				break
		res = '{}{}'.format(n[:i], n[i + 1:])
		for j in range(len(res)):
			if res[j] != '0':
				break
		if len(res[j:-1]) == 0:
			print(0)
		else:
			print(res[j:-1])
	n = sys.stdin.readline()


inp = input()
s = list(inp)
o = list()
z = list()
k = 0
for i in s:
	if i == '1':
		o.append(k)
	else:
		z.append(k)
	k += 1
o.sort()
z.sort()
if len(z) == 0:
	del s[o[len(o) - 1]:o[len(o) - 1] + 1]
else:
	del s[z[0]:z[0] + 1]
ans = ''.join([str(ele) for ele in s])
print(ans)


s = str(input())
a = list(s)
if '0' in a:
	a.remove('0')
else:
	a.remove('1')
for i in range(len(a)):
	print(a[i], end='')


x = input()
first = -1
try:
	t = x.index('0')
	if t + 1 < len(x):
		print(x[:t] + x[t + 1:])
	else:
		raise Exception
except:
	print(x[:-1])


s = input()
temp = s.find('0')
print(s[1:]) if temp == -1 else print(s[0:temp] + s[temp + 1:])


t = input
p = print
r = range
s = t()
if s.count('0') == 0:
	p(s[1:])
else:
	i = s.find('0')
	p(s[0:i] + s[i + 1:])


n = input()
f = 0
i = 0
ans = ''
while i < len(n):
	if n[i] == '0' and f == 0:
		i += 1
		f = 1
	else:
		ans += n[i]
		i += 1
if f == 0:
	print(n[:-1])
else:
	print(ans)


n = input()
flag = 0
if n.count('0') == 0:
	print(n[1:])
else:
	for i in range(len(n)):
		if n[i] == '0':
			index = i
			break
	print(n[0:index], end='')
	print(n[index + 1:len(n)])


from functools import reduce
str_list = list(input())
num_product = reduce(lambda x, y: int(x) * int(y), str_list)
if num_product == 0:
	lst = list(str_list)
	lst.remove('0')
	print(''.join(lst))
else:
	for i in range(len(str_list)):
		if str_list[i] != 0:
			lst = list(str_list)
			lst.remove('1')
			print(''.join(lst))
			break


n = input()
s = ''
flag = 0
for i in range(len(n)):
	if n[i] == '0':
		flag = 1
if flag == 0:
	for i in range(len(n) - 1):
		s += n[i]
	print(s)
else:
	flag = 0
	for i in range(len(n)):
		if n[i] == '1':
			s += n[i]
		if n[i] == '0':
			if flag == 1:
				s += n[i]
			else:
				flag = 1
	print(s)


s = list(input())
ans = []
co = False
for (i, c) in enumerate(s):
	if c == '0':
		ans = s[:i] + s[i + 1:]
		co = True
		break
if co == False:
	print(''.join(s[1:]))
else:
	print(''.join(ans))


s = input()
if '0' in s:
	x = s.index('0')
	print(s[:x] + s[x + 1:])
else:
	print(s[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 = list(input())
t = ''
flag = True
for i in range(len(s)):
	if flag and s[i] == '0':
		flag = False
		continue
	t += s[i]
if not flag:
	print(t)
else:
	print(t[:-1])


import sys
input = sys.stdin.readline

def prog():
	a = input().strip()
	for i in range(len(a)):
		if a[i] == '0':
			print(a[:i] + a[i + 1:])
			return
	print(a[:-1])
prog()


a = input()
if '0' in a:
	b = list(a)
	b.pop(b.index('0'))
	print(''.join(b))
else:
	print(a[:-1])


b = input().strip()
p = b.find('0')
os = ''
if p != -1:
	os = b[:p] + b[p + 1:]
else:
	os = b[1:]
print(os)


l = list(input())
if '0' in l:
	l.remove('0')
	print(''.join(l))
else:
	l.remove('1')
	print(''.join(l))


s = list(input())
if '0' in s:
	ind = s.index('0')
	del s[ind]
	print(''.join(s))
else:
	print(''.join(s[:-1]))


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


s = input()
idx = s.find('0')
print(s[1:] if idx == -1 else s[:idx] + s[idx + 1:])


b = input()
n = len(b)
if '0' in b:
	i = b.index('0')
	print(b[:i] + b[i + 1:])
else:
	print(b[:-1])


a = list(input())
if '0' not in a:
	a.pop()
else:
	for i in range(len(a)):
		if a[i] == '0':
			del a[i]
			break
print(''.join(a))


from __future__ import division, print_function
import os, sys
from io import BytesIO, IOBase
if sys.version_info[0] < 3:
	from __builtin__ import xrange as range
	from future_builtins import ascii, filter, hex, map, oct, zip

def ii():
	return int(input())

def si():
	return input()

def mi():
	return map(int, input().strip().split(' '))

def msi():
	return map(str, input().strip().split(' '))

def li():
	return list(mi())

def dmain():
	sys.setrecursionlimit(100000000)
	threading.stack_size(40960000)
	thread = threading.Thread(target=main)
	thread.start()
abc = 'abcdefghijklmnopqrstuvwxyz'
abd = {'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7, 'i': 8, 'j': 9, 'k': 10, 'l': 11, 'm': 12, 'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24, 'z': 25}
mod = 1000000007
inf = float('inf')
vow = ['a', 'e', 'i', 'o', 'u']
(dx, dy) = ([-1, 1, 0, 0], [0, 0, 1, -1])

def getKey(item):
	return item[1]

def sort2(l):
	return sorted(l, key=getKey)

def d2(n, m, num):
	return [[num for x in range(m)] for y in range(n)]

def isPowerOfTwo(x):
	return x and (not x & x - 1)

def decimalToBinary(n):
	return bin(n).replace('0b', '')

def ntl(n):
	return [int(i) for i in str(n)]

def powerMod(x, y, p):
	res = 1
	x %= p
	while y > 0:
		if y & 1:
			res = res * x % p
		y = y >> 1
		x = x * x % p
	return res

def gcd(x, y):
	while y:
		(x, y) = (y, x % y)
	return x

def isPrime(n):
	if n <= 1:
		return False
	if n <= 3:
		return True
	if n % 2 == 0 or n % 3 == 0:
		return False
	i = 5
	while i * i <= n:
		if n % i == 0 or n % (i + 2) == 0:
			return False
		i = i + 6
	return True

def read():
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('output.txt', 'w')

def main():
	s = list(si())
	f = 0
	for i in range(len(s)):
		if s[i] == '0':
			del s[i]
			f = 1
			break
	if f == 0:
		del s[len(s) - 1]
	print(''.join(s))
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')

def print(*args, **kwargs):
	(sep, file) = (kwargs.pop('sep', ' '), kwargs.pop('file', sys.stdout))
	at_start = True
	for x in args:
		if not at_start:
			file.write(sep)
		file.write(str(x))
		at_start = False
	file.write(kwargs.pop('end', '\n'))
	if kwargs.pop('flush', False):
		file.flush()
if sys.version_info[0] < 3:
	(sys.stdin, sys.stdout) = (FastIO(sys.stdin), FastIO(sys.stdout))
else:
	(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
main()


x = input()
l = len(x)
for n in range(l - 1):
	c = 0
	if x[n] == '0' and x[n + 1] == '1':
		if n != 0:
			x = x[0:n] + x[n + 1:l]
			print(x)
			c = 1
			break
		elif n == 0:
			x = x[1:l]
			print(x)
			c = 1
			break
if c == 0:
	if x[0] == '1' and x[l - 1] == '1':
		print(x[0:l - 1])
	elif x[0] == '1' and x[l - 1] == '0':
		print(x[0:l - 1])
	elif x[0] == '0' and x[l - 1] == '0':
		print(x[0:l - 1])


def b(n):
	index = n.find('0')
	if index == -1:
		return n[1:]
	else:
		return n[0:index] + n[index + 1:]
print(b(input()))


from sys import stdin, stdout, setrecursionlimit
input = stdin.readline
flush = stdout.flush
OUT = []

def write(item, sep=' '):
	if type(item) is int:
		OUT.append(str(item))
	elif type(item) is list:
		if type(item[0]) is int:
			OUT.append(sep.join(map(str, item)))
		else:
			OUT.append(sep.join(item))
	else:
		OUT.append(item)

def PRINT():
	print('\n'.join(OUT))
GI = lambda : int(input())
GS = lambda : input()[:-1]
gi = lambda : list(map(int, input().split()))
gs = lambda : input().split()
s = list(GS())
if '0' in s:
	s.remove('0')
else:
	s = s[:-1]
write(''.join(s))
PRINT()


from functools import reduce
from collections import Counter
import time
import datetime

def time_t():
	print('Current date and time: ', datetime.datetime.now())
	print('Current year: ', datetime.date.today().strftime('%Y'))
	print('Month of year: ', datetime.date.today().strftime('%B'))
	print('Week number of the year: ', datetime.date.today().strftime('%W'))
	print('Weekday of the week: ', datetime.date.today().strftime('%w'))
	print('Day of year: ', datetime.date.today().strftime('%j'))
	print('Day of the month : ', datetime.date.today().strftime('%d'))
	print('Day of week: ', datetime.date.today().strftime('%A'))

def ip():
	return int(input())

def sip():
	return input()

def mip():
	return map(int, input().split())

def mips():
	return map(str, input().split())

def lip():
	return list(map(int, input().split()))

def matip(n, m):
	lst = []
	for i in range(n):
		arr = lip()
		lst.append(arr)
	return lst

def factors(n):
	return list(set(reduce(list.__add__, ([i, n // i] for i in range(1, int(n ** 0.5) + 1) if n % i == 0))))

def minJumps(arr, n):
	jumps = [0 for i in range(n)]
	if n == 0 or arr[0] == 0:
		return float('inf')
	jumps[0] = 0
	for i in range(1, n):
		jumps[i] = float('inf')
		for j in range(i):
			if i <= j + arr[j] and jumps[j] != float('inf'):
				jumps[i] = min(jumps[i], jumps[j] + 1)
				break
	return jumps[n - 1]

def dic(arr):
	return Counter(arr)
n = sip()
if n.count('0') == 0:
	print(int(n) - int(10 ** (len(n) - 1)))
else:
	n = n.replace('0', '', 1)
	print(n)


s = input()
x = []
c = 0
o = 0
w = s.count('0')
if w > 0:
	for i in s:
		if i == '0' and c == 0:
			c += 1
		else:
			if i == '1':
				o += 1
			if o > 0:
				x.append(i)
else:
	for i in range(1, len(s)):
		x.append(s[i])
x = ''.join(x)
print(x)


n = input()
s = ''
c = 0
for i in n:
	if i == '0':
		c += 1
		if c > 1:
			s += i
	else:
		s += i
if c > 0:
	print(s)
else:
	for i in range(len(s) - 1):
		print(s[i], end='')


s = input()
ans = ''
flag = True
for i in range(len(s)):
	if s[i] != '0':
		ans += s[i]
	else:
		flag = False
		ans += s[i + 1:]
		break
print(ans if not flag else s[1:])


string = input()
print(string.replace('0' if '0' in string else '1', '', 1))


st = input()
chck = 0
for i in range(1, len(st)):
	if st[i] == '0' and st[i - 1] != '0':
		print(st[:i] + st[i + 1:])
		chck = 1
		break
if chck == 0:
	print(st[:len(st) - 1])


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)


import os
import sys
from math import *
from collections import *
from bisect import *
from io import BytesIO, IOBase

def vsInput():
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('output.txt', 'w')
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')

def value():
	return tuple(map(int, input().split()))

def array():
	return [int(i) for i in input().split()]

def Int():
	return int(input())

def Str():
	return input()

def arrayS():
	return [i for i in input().split()]
s = input()
try:
	ind = s.index('0')
	ans = s[:ind] + s[ind + 1:]
except:
	ans = s[:-1]
print(ans)


n = input()
if '0' in n:
	x = n.find('0')
	print(n[0:x], n[x + 1:], sep='')
else:
	print(n[1:])


n = input()
if '0' not in n:
	n = n[:len(n) - 1]
else:
	pos = n.index('0')
	n = n[:pos] + n[pos + 1:]
print(n)


x = input()
if '0' in x:
	print(x.replace('0', '', 1))
else:
	print(x.replace('1', '', 1))


s = input()
if s == '1':
	print(0)
	exit(0)
if s.find('0') == -1:
	print(s[:-1])
	exit(0)
idx = s.find('0')
print(s[:idx], s[idx + 1:], sep='')


import copy
a = list(input())
b = copy.copy(a)
k = len(a)
for i in range(0, k):
	if (a[i - 1] == '1' or a[i + 1] == '1') and a[i] == '0':
		a.remove(a[i])
		break
if len(b) > len(a):
	print(''.join(a))
else:
	a.remove(a[1])
	print(''.join(a))


a = input()
if '0' in a:
	print(a.replace('0', '', 1))
else:
	print(a[:-1])


import sys
array = sys.stdin.readline()
str_val = ''
removed = False
for i in array:
	if not removed:
		if i == '0':
			removed = True
		else:
			str_val += i
	else:
		str_val += i
if removed == False:
	print(str_val[:-2])
else:
	print(str_val)


s = input()
if '0' in s:
	a = s.index('0')
	s = s[:a] + s[a + 1:]
else:
	s = s[:-1]
print(s)


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


def f(l):
	if '0' not in l:
		return ''.join(l[1:])
	i = l.index('0')
	return ''.join(l[:i] + l[i + 1:])
l = list(input())
print(f(l))


inp_arr = lambda : list(map(int, input().split()))
s = input()
idx = s.find('0')
if idx != -1:
	print(s[:idx] + s[idx + 1:])
else:
	print('1' * (len(s) - 1))


s = input()
f = 0
for i in range(len(s)):
	if s[i] == '0':
		a = s[:i] + s[i + 1:]
		f = 1
		break
if f:
	print(a)
else:
	print(s[1:])


a = input()
if a.find('0') != -1:
	a = a.replace('0', '', 1)
else:
	a = a.replace('1', '', 1)
print(a)


n = list(input())
m = 0
for i in range(len(n)):
	if n[i] == '0':
		m = i
		break
k = n[:m] + n[m + 1:]
print(''.join(k))


s = str(input())
if '0' in s:
	k = int(s.index('0'))
print(s[:k] + s[k + 1:] if '0' in s else s[:len(s) - 1])


binary = input()

def main(binary):
	replace_position = 0
	for i in range(len(binary)):
		if binary[i] == '0':
			replace_position = i
			break
	result_binary = binary[:replace_position] + binary[replace_position + 1:]
	return result_binary

def brute_solution(binary):
	result_binary = ''
	largest_value = 0
	for i in range(len(binary)):
		current_binary = binary[:i] + binary[i + 1:]
		value = int(current_binary, 2)
		if value > largest_value:
			largest_value = value
			result_binary = current_binary
	return result_binary
print(main(binary))


l = [i for i in input()]
if l.count('1') == len(l):
	print(''.join(l[1:]))
else:
	for i in range(len(l)):
		if l[i] == '0':
			ll = l[:i]
			if i + 1 < len(l):
				ll += l[i + 1:]
			print(''.join(ll))
			break


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))


a = input()
succ = False
for i in range(len(a)):
	if a[i] == '0':
		a = a[:i] + a[i + 1:]
		succ = True
		break
if succ:
	print(a)
else:
	print(a[1:])


string = list(input())
if '0' in string:
	string.remove('0')
	print(''.join(string))
else:
	string.remove('1')
	print(''.join(string))


def main():
	num = input()
	for (i, c) in enumerate(num):
		if c == '0':
			print(num[:i] + num[i + 1:])
			return
	print(num[:-1])
main()


n = input()
n = list(n)
c = 0
for i in range(len(n)):
	if n[i] == '0':
		n.remove('0')
		c += 1
		break
	else:
		continue
a = ''
if c == 1:
	for q in n:
		a = a + str(q)
	print(a)
else:
	n.remove('1')
	for q in n:
		a = a + str(q)
	print(a)


import sys, math
from collections import deque, defaultdict
import operator as op
from functools import reduce
from itertools import permutations
I = sys.stdin.readline

def ii():
	return int(I().strip())

def li():
	return list(map(int, I().strip().split()))

def mi():
	return map(int, I().strip().split())

def ncr(n, r, p):
	num = den = 1
	for i in range(r):
		num = num * (n - i) % p
		den = den * (i + 1) % p
	return num * pow(den, p - 2, p) % p

def gcd(x, y):
	while y:
		(x, y) = (y, x % y)
	return x

def valid(row, col, rows, cols, rcross, lcross):
	return rows[row] == 0 and cols[col] == 0 and (rcross[col + row] == 0) and (lcross[col - row] == 0)

def div(n):
	tmp = []
	for i in range(2, int(n ** 0.5) + 1):
		if n % i == 0:
			cnt = 0
			while n % i == 0:
				n = n // i
				cnt += 1
			tmp.append((i, cnt))
	if n > 1:
		tmp.append((n, 1))
	return tmp

def isPrime(n):
	if n <= 1:
		return False
	elif n <= 2:
		return True
	else:
		flag = True
		for i in range(2, int(n ** 0.5) + 1):
			if n % i == 0:
				flag = False
				break
		return flag

def s(b):
	ans = []
	while b > 0:
		tmp = b % 10
		ans.append(tmp)
		b = b // 10
	return ans

def main():
	s = I().strip()
	pos = -1
	for i in range(len(s)):
		if s[i] == '0':
			pos = i
			break
	if pos == -1:
		print(s[:-1])
	else:
		print(s[:pos] + s[pos + 1:])
main()


s = str(input())
i = 0
n = len(s)
while i < n:
	if s[i] == '0':
		index = i
		break
	i += 1
if i == n:
	index = i - 1
for i in range(n):
	if i != index:
		print(s[i], end='')


n = list(map(int, input()))
try:
	idx = n.index(0)
	n.pop(idx)
	print(*n, sep='')
except:
	print(*n[1:], sep='')


li = list(input())
if '0' in li:
	li.remove('0')
else:
	li.remove('1')
print(''.join(li))


import bisect
import math
import heapq
import random

def unpack(func=int):
	return map(func, input().split())

def l_unpack(func=int):
	return list(map(func, input().split()))

def s_unpack(func=int, rev=False):
	return sorted(map(func, input().split()), reverse=rev)

def ml_unpack(n):
	return [int(input()) for _ in range(n)]

def range_n():
	return range(int(input()))

def getint():
	return int(input())

def counter(a):
	d = {}
	for x in a:
		if x in d:
			d[x] += 1
		else:
			d[x] = 1
	return d

def factor(n):
	d = {}
	while not n % 2:
		d[2] = d.get(2, 0) + 1
		n //= 2
	i = 3
	while i * i <= n:
		while not n % i:
			d[i] = d.get(i, 0) + 1
			n //= i
		i += 2
	if n > 1:
		d[n] = d.get(n, 0) + 1
	return d

def main():
	n = input()
	flag = True
	for v in n[:-1]:
		if v == '0' and flag:
			flag = False
			continue
		print(v, end='')
	if not flag:
		print(n[-1])
	print()
main()


s = str(input())
stack = [s[0]]
done = True
for i in s[1:]:
	if int(i) > int(stack[-1]) and done:
		stack.pop()
		done = False
	stack.append(i)
if done:
	stack.pop()
print(''.join(stack))


a = list(input())
if a.count('0') > 0:
	for j in range(len(a)):
		if a[j] == '0':
			a.pop(j)
			break
	print(''.join(a))
else:
	a.pop(-1)
	print(''.join(a))


n = input()
count = 0
for j in range(len(n)):
	if n[j] == '0':
		count = 1
if count >= 1:
	i = 9999999999999999999
	i = n.find('0')
	for j in range(len(n)):
		if j == i:
			continue
		print(n[j], end='')
else:
	for j in range(len(n) - 1):
		print(n[j], end='')


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]))


s = input()
if '0' in s:
	p = s.index('0')
	print(s[:p] + s[p + 1:])
else:
	print(s[:len(s) - 1])


a = input()
c = 0
li = []
for i in range(len(a)):
	if a[i] == '1':
		li.append(1)
	elif a[i] == '0' and c == 1:
		li.append(0)
	elif a[i] == '0' and c == 0:
		c = 1
if c == 0:
	for i in range(1, len(li)):
		print(li[i], end='')
else:
	for i in range(len(li)):
		print(li[i], end='')


BS = '0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ'

def to_base(s, b):
	res = ''
	while s:
		res += BS[s % b]
		s //= b
	return res[::-1] or '0'
alpha = 'abcdefghijklmnopqrstuvwxyz'
from collections import Counter
s = list(input())
found = False
for i in range(len(s) - 1):
	if s[i + 1] == '1' and s[i] == '0':
		found = True
		break
if found:
	s.pop(i)
else:
	s.pop(-1)
print(''.join(s))


s = input()
print(s[0:s.find('0')] + s[s.find('0') + 1:] if '0' in s else s[0:-1])


num = input()
if num[0] == '0':
	print(num[1:len(num)])
else:
	first_zero = num.find('0')
	if first_zero == -1:
		print(num[1:len(num)])
	else:
		print(num[:first_zero] + num[first_zero + 1:len(num)])


def main(n):
	if n.count('0'):
		i = n.index('0')
		res = n[:i] + n[i + 1:]
		print(res)
		return
	res = n[:-1]
	print(res)
	return
n = input()
main(n)


number = input()
length = len(number)
for i in range(length):
	if number[i] == '0':
		number = number[0:i] + number[i + 1:]
		break
if len(number) == length:
	number = number[1:]
print(number)


import sys
import math
import os
from collections import Counter
a_1 = list(sys.stdin.readline())
a_2 = a_1.copy()
setes = Counter(a_1)
if setes['0'] == 0:
	print(''.join(a_1[:-2]))
else:
	for x in a_1:
		if x == '0':
			a_2.remove(x)
			break
	print(''.join(a_2))


a = input()
t = a.find('0')
if t == -1:
	l = len(a)
	a = a[0:l - 1]
	print(a)
else:
	l = len(a)
	a = a[0:t] + a[t + 1:l]
	print(a)


s = input()
if s == '1':
	print(0)
else:
	s1 = ''
	k = 0
	while k < len(s):
		if s[k] == '0':
			break
		s1 += s[k]
		k += 1
	s1 += s[k + 1:]
	if k == len(s):
		print(s[1:])
	else:
		print(s1)


n = input()
ind = n.find('0')
if ind < 0:
	print(n[:len(n) - 1])
else:
	print(n[:ind] + n[ind + 1:])


str = input()
removePos = len(str) - 1
for i in range(len(str)):
	if str[i] == '0':
		removePos = i
		break
for i in range(len(str)):
	if i != removePos:
		print(str[i], end='')
print()


a = input()
if len(set(a)) == 1:
	print(a[0] * (len(a) - 1))
else:
	a = list(a)
	first = a.index('0')
	a.pop(first)
	print(''.join(a))


s = input()
if '0' not in s:
	print(s[1:])
else:
	e = s.index('0')
	s = s[:e] + s[e + 1:]
	print(s)


s = input()
l = len(s)
if s.count('1') == l:
	print('1' * (l - 1))
else:
	j = 0
	for i in range(l):
		if s[i] == '0':
			j = i
			break
	s = list(s)
	s.pop(j)
	print(''.join(s))


import re

def bigBinary(bino):
	if '0' in bino:
		return re.sub('0', '', bino, 1)
	return bino[1:]
print(bigBinary(input()))


n = input()
s = ''
s1 = n[1:]
a = 1
for i in range(len(n)):
	if n[i] == '0':
		s = n[0:i] + n[i + 1:]
		a = 0
		break
if a == 0:
	print(s)
else:
	print(s1)


a = input()
if a[0] == '0':
	print(a[1:])
else:
	i = c = 0
	s1 = ''
	while i < len(a):
		if a[i] == '0' and c == 0:
			c = 1
		else:
			s1 += a[i]
		i += 1
	if c == 0:
		print(s1[1:])
	else:
		print(s1)


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


s = input()
x = s.count('0')
n = len(s)
if x == 0:
	print('1' * (n - 1))
else:
	r = []
	f = 0
	for i in range(n):
		if s[i] == '0' and f == 0:
			f = 1
			continue
		else:
			r.append(s[i])
	print(''.join(r))


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


a = list(input())
x = a.count('0')
if x == 0:
	a.pop()
else:
	a.remove('0')
for i in range(len(a)):
	print(a[i], end='')


n = input()
for i in range(len(n)):
	if n[i] == '0':
		print(n[:i] + n[i + 1:])
		quit()
print(n[:len(n) - 1])


s = input()
t = False
for i in range(len(s)):
	if s[i] == '0':
		t = True
		s = s[:i] + s[i + 1:]
		break
print(s if t else s[1:])


def main():
	from sys import stdin, stdout
	s = stdin.readline().strip()
	minim = -1
	for (i, j) in enumerate(s):
		if j == '0':
			minim = i
			break
	if minim == -1:
		stdout.write(s[1:] + '\n')
	else:
		stdout.write(s[:minim] + s[minim + 1:] + '\n')
main()


s = input()
j = s.find('0')
if j == -1:
	print(s[1:])
else:
	r = s[:j] + s[j + 1:]
	print(r)


a = input()
a = list(a)
if '0' in a:
	i = a.index('0')
	a.pop(i)
else:
	a.pop(1)
print(*a, sep='')


s = input()
f = 1
t = s
for i in range(len(s)):
	if s[i] == '0':
		s = s[:i] + s[i + 1:]
		print(s)
		break
if t.count('0') == 0:
	print(t[1:])


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


import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, copy, functools
sys.setrecursionlimit(10 ** 7)
inf = 10 ** 20
eps = 1.0 / 10 ** 10
mod = 10 ** 9 + 7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]

def LI():
	return [int(x) for x in sys.stdin.readline().split()]

def LI_():
	return [int(x) - 1 for x in sys.stdin.readline().split()]

def LF():
	return [float(x) for x in sys.stdin.readline().split()]

def LS():
	return sys.stdin.readline().split()

def I():
	return int(sys.stdin.readline())

def F():
	return float(sys.stdin.readline())

def S():
	return input()

def pf(s):
	return print(s, flush=True)

def main():
	s = [c for c in S()]
	r = []
	if '0' in s:
		i = s.index('0')
		r = s[:i] + s[i + 1:]
	else:
		r = s[1:]
	return ''.join(r)
print(main())


number = input()
for (i, c) in enumerate(number):
	if c == '0':
		number = number[:i] + number[i + 1:]
		break
else:
	number = number[1:]
print(number)


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


k = input()
res = ''
flag = False
for i in range(len(k)):
	if (k[i] == '0' or len(res) + 1 == len(k)) and flag == False:
		flag = True
	else:
		res += k[i]
print(res)


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


s = input()
done = False
for (i, c) in enumerate(s):
	if c == '0' and (not done):
		done = True
	elif i == len(s) - 1 and (not done):
		done = True
		continue
	else:
		print(c, end='')


n = [*input()]
l = len(n)
i = 0
while i < l and n[i] == '1':
	i += 1
if i < l:
	n.pop(i)
else:
	n.pop(i - 1)
print(''.join(n))


n = input()
k = 0
zero = 0
for i in n:
	if i == '0':
		zero = 1
		break
	k += 1
if zero == 1:
	s = ''
	for i in range(len(n)):
		if i != k:
			s += n[i]
	print(s)
else:
	for i in range(len(n) - 1):
		print(n[i], end='')


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


import sys, itertools, math

def ia():
	return [int(i) for i in sys.stdin.readline().strip().split(' ')]

def ii():
	return int(sys.stdin.readline().strip())

def istr():
	return sys.stdin.readline().strip()
n = istr()
for i in range(len(n)):
	if n[i] == '0':
		print(n[:i] + n[i + 1:])
		break
else:
	print(n[1:])


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


import sys
a = sys.stdin.readline().strip()
for i in range(len(a)):
	if a[i] == '0':
		print(a[:i] + a[i + 1:])
		sys.exit(0)
print(a[1:])


import math

def main():
	s = input()
	if s.count('0') == len(s) or s.count('1') == len(s):
		print(s[1:])
	else:
		for i in range(len(s)):
			if s[i] == '0':
				print(s[:i] + s[i + 1:])
				return
main()


s = input()
l = len(s)
h = 0
for i in range(l):
	if s[i] == '0':
		h = 1
		try:
			s = s[:i] + s[i + 1:]
		except:
			s = s[:i]
		break
if h == 0:
	s = s[:l - 1]
print(s)


s = input()
ans = ''
flag = 0
for x in s:
	if x == '0' and flag == 0:
		flag = 1
	else:
		ans += x
if flag == 1:
	print(ans)
else:
	for i in range(len(ans) - 1):
		print(ans[i], end='')


a = input()
c = True
str1 = ''
for i in a:
	if i == '0' and c:
		c = False
	else:
		str1 += i
if '0' not in a:
	print(str1[:-1])
else:
	print(str1)


digits = str(input())
n = len(digits)
firstZero = -1
for i in range(n):
	if digits[i] == '0':
		firstZero = i
		break
if firstZero == -1:
	print(digits[1:])
else:
	print(digits[0:firstZero] + digits[firstZero + 1:])


from sys import stdin, stdout
from bisect import bisect_left, bisect_right
n = input()
result = ''
l = len(n)
flag = 0
for i in range(l):
	if n[i] == '1':
		result = result + '1'
	else:
		flag = 1
		break
if flag == 0:
	print('1' * (l - 1))
else:
	for i in range(i + 1, l):
		result = result + n[i]
	print(result)


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


s = list(input())
if 0 == s.count('0'):
	print(''.join(s[1:]))
else:
	s.remove('0')
	print(''.join(s))


a = input()
k = ''
for i in range(len(a)):
	if a[i] == '0':
		k = a[:i] + a[i + 1:]
		break
if k == '':
	print(a[:len(a) - 1])
else:
	print(k)


def test():
	n = input()
	ans = 0
	for i in range(len(n)):
		if n[i] == '0':
			print(n[:i] + n[i + 1:])
			return
	print(n[:-1])
test()


a = input()
a = list(a)
if '0' in a:
	a.remove('0')
else:
	a.remove('1')
for i in a:
	print(i, end='')


import sys, threading, os.path
import collections, heapq, math, bisect
import string
from platform import python_version
import itertools
sys.setrecursionlimit(10 ** 6)
threading.stack_size(2 ** 27)

def main():
	if os.path.exists('input.txt'):
		input = open('input.txt', 'r')
	else:
		input = sys.stdin
	st = str(input.readline().rstrip('\n'))
	res = ''
	maxnum = -1
	for (i, x) in enumerate(st):
		if x == '0':
			maxnum = i
			break
	if maxnum == -1:
		res = st[1:]
	else:
		for i in range(len(st)):
			if i != maxnum:
				res += st[i]
	output = res
	if os.path.exists('output.txt'):
		open('output.txt', 'w').writelines(str(output))
	else:
		sys.stdout.write(str(output))
main()


x = input()
if '0' in x:
	for i in x:
		if i == '0':
			print(x[0:x.index(i)] + x[x.index(i) + 1:])
			break
else:
	print(x[1:])


binary = input()
try:
	charIndex = binary.index('0')
except:
	charIndex = 0
newBinary = f'{binary[:charIndex]}{binary[charIndex + 1:]}'
print(newBinary)


s = input()
n = len(s)
flag = True
for i in range(n):
	if s[i] == '0':
		result = s[0:i] + s[i + 1:n]
		flag = False
		break
if flag:
	result = s[0:n - 1]
print(result)


s = input()
n = len(s)
f = 0
x = []
for i in s:
	if i == '0' and (not f):
		f = 1
		continue
	x.append(i)
if not f:
	x.pop()
print(''.join(x))


s = input()
l = len(s)
flag = 0
for i in range(l):
	if s[i] == '0':
		print(s.replace('0', '', 1))
		flag = 1
		break
if flag == 0:
	print(s.replace('1', '', 1))


(string, flag) = (input().strip(), True)
for i in range(len(string)):
	if string[i] == '0':
		print(string[:i] + string[i + 1:])
		flag = False
		break
if flag:
	print(string[:-1])


import sys, math
s = input()
one = s.index('1')
while one < len(s) and s[one] != '0':
	one += 1
if s.count('0') == 0:
	print(s[0:-1])
else:
	print(s[0:one] + s[one + 1:])


n = list(input())
if '0' in n:
	print(''.join([''.join(n[:n.index('0')]), ''.join(n[n.index('0') + 1:])]))
else:
	print(''.join(n[1:]))


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()


n = list(input())
if '0' in n:
	n.remove('0')
else:
	n.pop()
print(''.join(n))


num = list(input())
ini_len = len(num)
for i in range(len(num)):
	if num[i] == '0':
		del num[i]
		break
if len(num) == ini_len:
	del num[-1]
print(''.join(num))


b = input()
if '0' in b:
	print(b.replace('0', '', 1))
else:
	print(b.replace('1', '', 1))


s = str(input())
if '0' not in s:
	print(s[0:-1])
	exit()
ind = s.index('0')
s = s[0:ind] + s[1 + ind:]
print(s)


a = list(input())
found = False
foundZero = False
l = []
for i in range(len(a)):
	if not found and a[i] == '1':
		found = True
	if found and a[i] == '0' and (not foundZero):
		foundZero = True
	else:
		l.append(a[i])
if not foundZero:
	print(''.join(l[0:len(a) - 1]))
else:
	print(''.join(l))


s = input()
x = s.find('0')
if x == -1:
	s = ''.join(s.replace(s[0], '', 1))
else:
	s = ''.join(s.replace(s[x], '', 1))
print(s)


s = input()
if s.count('0') <= 0:
	s = s.replace('1', '', 1)
for i in range(0, len(s)):
	if s[i] == '0':
		s = s.replace(s[i], '', 1)
		break
print(s)


from math import *
from collections import *
from random import *
from bisect import *
import sys

def lis():
	return list(map(int, input().split()))

def ma():
	return map(int, input().split())

def inp():
	return int(input())
s = input().rstrip('\n')
if s.count('1') == len(s):
	print('1' * (len(s) - 1))
else:
	z = s.index('0')
	print(s[:z] + s[z + 1:])


binary = input()
cnt = 0
lst = []
for i in range(len(binary)):
	if binary[i] == '0' and cnt == 0:
		cnt += 1
		continue
	lst.append(binary[i])
if cnt == 0:
	for i in range(len(binary) - 1):
		print(binary[i], end='')
else:
	print(''.join(lst))


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


def little_elephant_and_bits(a):
	if '0' not in a:
		a.pop(a.index('1'))
	else:
		a.pop(a.index('0'))
	return ''.join(a)
a = list(input())
print(little_elephant_and_bits(a))


s = input()
if s.count('0') == 0:
	print(s[1:])
	exit(0)
for i in range(len(s)):
	if s[i] == '0':
		print(s[:i] + s[i + 1:])
		exit(0)
assert 0


a = list(map(int, input()))
z = -1
for i in range(0, len(a)):
	if a[i] == 0:
		a.pop(i)
		z = i
		break
if z == -1:
	for i in range(len(a) - 1, -1, -1):
		if a[i] == 1:
			a.pop(i)
			z = i
			break
print(*a, sep='')


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


s = str(input())
f = ''
l = len(s)
p = 0
for i in range(0, l, 1):
	if s[i] == '0':
		p = i
		break
for i in range(0, l, 1):
	if i != p:
		f += s[i]
print(f)


s = list(input())
if '0' in s:
	s.remove('0')
else:
	s.remove('1')
while len(s) != 0:
	if s[0] == '0':
		s.remove('0')
	else:
		break
if len(s) != 0:
	print(''.join(s))
else:
	print(0)


integer = input()
index = integer.find('0')
if index > 0:
	print(integer[:index] + (integer[index + 1:] if index != len(integer) - 1 else ''))
else:
	print(integer[:-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:])


n = list(input())
if '0' in n:
	l = n.index('0')
else:
	l = len(n) - 1
print(''.join(n[:l] + n[l + 1:]))


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


s = list(input())
if '0' in s:
	s.remove(s[s.index('0')])
	print(*s, sep='')
else:
	s = s[:-1]
	print(*s, sep='')


a = list(input())
try:
	a.remove('0')
except:
	a.remove('1')
finally:
	print(''.join(a))


i = input()
first = i.find('1')
if first > 0:
	print(i[first:])
elif '0' in i:
	z = i.find('0')
	print(i[:z] + i[z + 1:])
else:
	print(i[1:])


a = input()
b = list(a)
for i in range(len(a)):
	if b[i] == '0':
		del b[i]
		break
if len(a) == len(b):
	del b[-1]
print(''.join(b))


str = input()
if '0' in str:
	print(str.replace('0', '', 1))
else:
	print(str[:len(str) - 1])


n = input()
l = list(n)
if l.__contains__('0'):
	l.remove('0')
	print(''.join(l))
else:
	l.remove('1')
	print(''.join(l))


def main():
	number = [digit for digit in input().strip()]
	for i in range(1, len(number)):
		if number[i] == '0':
			number.pop(i)
			return ''.join(number)
	number.pop()
	return ''.join(number)
print(main())


astr = input()
found0 = 0
for i in range(len(astr)):
	if int(astr[i]) == 0:
		astr = astr[:i] + astr[i + 1:]
		found0 = 1
		break
if found0 == 0:
	astr = astr[:len(astr) - 1]
print(astr)


b = input()
c = ''
n = len(b)
if '0' not in b:
	print(b[:n - 1])
else:
	flag = 0
	for i in range(n):
		if b[i] != '0':
			c += b[i]
		else:
			flag = i + 1
			break
	c += b[flag:]
	print(c)


import sys

def input():
	return sys.stdin.readline().strip()

def iinput():
	return int(input())

def rinput():
	return map(int, sys.stdin.readline().strip().split())

def get_list():
	return list(map(int, sys.stdin.readline().strip().split()))
a = list(input())
if '0' in a:
	a.remove('0')
else:
	a.pop()
print(*a, sep='')


s = input()
ans = ''
checked = False
for i in s:
	if i == '0' and (not checked):
		checked = True
	else:
		ans += i
print(ans if checked else ans[0:-1])


a = list(input())
if '0' in a:
	a.remove('0')
else:
	a.remove('1')
b = ''.join(a)
print(b)


t = input()
if t.count('1') == len(t):
	print(t[:len(t) - 1])
	exit()
n = t.index('0')
print(t[:n] + t[n + 1:])


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


n = list(input())
rem = -1
for i in range(len(n) - 1):
	if n[i] == '1' and n[i + 1] == '0':
		rem = i + 1
		break
n.pop(rem)
print(''.join(n))


s = input()
f = s.find('0')
print(s[:f] + s[f + 1:] if f >= 0 else s[:-1])


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


from math import *
from copy import *
from string import *
from random import *
from sys import stdin
from sys import maxsize
from operator import *
from itertools import *
from collections import Counter
import math

def bin1(l, r, k, t, b, val, ans):
	if l > r:
		return ans
	else:
		mid = (l + r) // 2
		v = k ** mid
		if v == val:
			return v
		elif v > val:
			ans = mid
			return bin1(mid + 1, r, k, t, b, val, ans)
		else:
			return bin1(l, mid - 1, k, t, b, val, ans)

def bin2(l, r, k, t, b, val, ans):
	if l > r:
		return ans
	else:
		mid = (l + r) // 2
		v = t * k ** mid + b * mid
		if v == val:
			return v
		elif v > val:
			ans = mid
			return bin2(l, mid - 1, k, t, b, val, ans)
		else:
			return bin2(mid + 1, r, k, t, b, val, ans)

def SieveOfEratosthenes(n):
	prime = [True for i in range(n + 1)]
	p = 2
	while p * p <= n:
		if prime[p] == True:
			for i in range(p * p, n + 1, p):
				prime[i] = False
		p += 1
	l = []
	for i in range(2, n + 1):
		if prime[i]:
			l.append(i)
	return l

def bin(l, r, ll, val):
	if l > r:
		return -1
	else:
		mid = (l + r) // 2
		if val >= ll[mid][0] and val <= ll[mid][1]:
			return mid
		elif val < ll[mid][0]:
			return bin(l, mid - 1, ll, val)
		else:
			return bin(mid + 1, r, ll, val)

def deci(n):
	s = ''
	while n != 0:
		if n % 2 == 0:
			n = n // 2
			s = '0' + s
		else:
			n = n // 2
			s = '1' + s
	return s

def diff(s1, s2):
	if len(s1) < len(s2):
		v = len(s1)
		while v != len(s2):
			s1 = '0' + s1
			v = v + 1
	else:
		v = len(s2)
		while v != len(s1):
			s2 = '0' + s2
			v = v + 1
	c = 0
	for i in range(len(s1)):
		if s1[i:i + 1] != s2[i:i + 1]:
			c = c + 1
	return c
from sys import stdin, stdout

def fac(a, b):
	v = a
	while a != b:
		v *= a - 1
		a = a - 1
	return v

def bino(l, r, n):
	if l > r:
		return -1
	else:
		mid = (l + r) // 2
		val1 = math.log(n / mid + 1, 2)
		val2 = int(val1)
		if val1 == val2:
			return val1
		elif val1 < 1.0:
			return bino(l, mid - 1, n)
		else:
			return bino(mid + 1, r, n)

def binary(l, r, ll, val, ans):
	if l > r:
		return ans
	else:
		mid = (l + r) // 2
		if ll[mid] == val:
			return ll[mid]
		elif ll[mid] < val:
			ans = ll[mid]
			return binary(mid + 1, r, ll, val, ans)
		else:
			return binary(l, mid - 1, ll, val, ans)

def check(n):
	v = 1
	while n != 0:
		if n % 10 == 0 or n % 10 == 1:
			n = n // 10
		else:
			v = 0
			break
	return v
s = str(stdin.readline())
boo = False
s1 = ''
for i in range(len(s)):
	if s[i:i + 1] == '0':
		boo = True
		s1 = s[0:i] + s[i + 1:]
		break
if boo:
	print(s1)
else:
	print(s[1:])


b = input()
n = list(b)
j = n
l = len(n)
g = []
i = 0
lu = 0
q = n.count('1')
if q != l:
	rt = b.find('0')
	del n[rt]
	kuli = ''.join(n)
	print(kuli)
elif q == l:
	del n[l - 1]
	dy = ''.join(n)
	print(dy)


a = input()
A = []
b = 0
c = 0
for i in a:
	if i == '0' and b == 0:
		b = b + 1
		c = c + 1
		continue
	else:
		A.append(i)
s = ''
if c == 1:
	for j in A:
		s = s + j
else:
	for k in range(0, len(A) - 1):
		s = s + A[k]
print(s)


s = input()
if s.find('0') == -1:
	print(s.replace('1', '', 1))
else:
	print(s.replace('0', '', 1))


n = list(input())
if n[0] == '0':
	ans = n[1:]
	while ans[0] == '0':
		ans = ans[1:]
	print(''.join(ans))
else:
	z = -1
	ans = 0
	for x in range(0, len(n)):
		if n[x] == '0':
			n.pop(x)
			z = 1
			break
	ans = ''.join(n)
	if z == 1:
		print(ans)
	else:
		print(''.join(n[1:]))


n = input()
loc = 0
for i in range(len(n)):
	if n[i] == '0':
		loc = i
		break
ans = n[:loc] + n[loc + 1:]
print(ans)


s = input()
s = list(s)
while True:
	if s.count('0') == 1 and s[len(s) - 1] == '0':
		s.remove('0')
		break
	if s.count('1') == len(s):
		s.remove('1')
		break
	if s.count('0') == len(s):
		s.remove('0')
		break
	if True:
		s.remove('0')
		break
print(''.join(s))


from math import factorial
s = input()
f = s.find('0')
if f != -1:
	print(s[:f] + s[f + 1:])
else:
	print(s[1:])


def fastio():
	import sys
	from io import StringIO
	from atexit import register
	global input
	sys.stdin = StringIO(sys.stdin.read())
	input = lambda : sys.stdin.readline().rstrip('\r\n')
	sys.stdout = StringIO()
	register(lambda : sys.__stdout__.write(sys.stdout.getvalue()))
fastio()
MOD = 10 ** 9 + 7
I = lambda : list(map(int, input().split()))
s = input()
if all([i == '1' for i in s]):
	print(s[1:])
	exit()
for i in range(len(s)):
	if s[i] == '0':
		print(s[i + 1:])
		break
	else:
		print(s[i], end='')


s = list(input())
if '0' in s:
	s.remove('0')
else:
	s.pop()
for i in s:
	print(i, end='')


a = input()
b = list(a)
for i in range(len(b)):
	if b[i] == '0':
		b.pop(i)
		print(''.join(map(str, b)))
		break
else:
	b.pop(0)
	print(''.join(map(str, b)))


import sys

def f(b):
	n = 0
	for (i, char) in enumerate(b):
		if char == '0':
			return b[:i] + b[i + 1:]
	if n == 0:
		return b[:-1]
for line in sys.stdin:
	b = line.strip()
	ans = f(b)
	print(ans)


s = input()
n = len(s)
x = -1
for q in range(n):
	if s[q] == '0':
		x = q
		break
if x == -1:
	print(s[1:])
else:
	print(s[:x] + s[x + 1:])


import sys
binary = sys.stdin.readline()
a = 0
for i in range(len(binary)):
	if binary[i] == '0':
		binary = binary[:i] + binary[i + 1:]
		print(binary)
		a = 1
		break
if a == 0:
	print(binary[:-2])


n = input()
a = [x for x in n]
if n.count('0') > 0:
	a.remove('0')
	print(''.join(a))
else:
	del a[-1]
	print(''.join(a))


s = input().split()[0]
i = s.find('0')
if i == -1:
	print(s[1:])
else:
	c = s.find('1')
	if c > 0:
		print(s[c:])
	else:
		print(s[:i], s[i + 1:], sep='')


s = input()
flag = 1
for i in range(len(s)):
	if s[i] == '0':
		temp = i
		flag = 0
		break
if flag:
	temp = 0
print(s[0:temp] + s[temp + 1:])


num = input()
ans = ''
check = set(num)
if '0' not in check:
	ans = '1' * (len(num) - 1)
else:
	i = 0
	while num[i] != '0':
		i += 1
	ans = num[0:i] + num[i + 1:]
print(ans)


import sys
input = sys.stdin.readline
from math import log2, log, ceil

def swaparr(arr, a, b):
	temp = arr[a]
	arr[a] = arr[b]
	arr[b] = temp

def gcd(a, b):
	if a == 0:
		return b
	return gcd(b % a, a)

def nCr(n, k):
	if k > n - k:
		k = n - k
	res = 1
	for i in range(k):
		res = res * (n - i)
		res = res / (i + 1)
	return res

def upper_bound(a, x, lo=0):
	hi = len(a)
	while lo < hi:
		mid = (lo + hi) // 2
		if a[mid] < x:
			lo = mid + 1
		else:
			hi = mid
	return lo

def primefs(n):
	primes = {}
	while n % 2 == 0:
		primes[2] = primes.get(2, 0) + 1
		n = n // 2
	for i in range(3, int(n ** 0.5) + 2, 2):
		while n % i == 0:
			primes[i] = primes.get(i, 0) + 1
			n = n // i
	if n > 2:
		primes[n] = primes.get(n, 0) + 1
	return primes

def power(x, y, p):
	res = 1
	x = x % p
	if x == 0:
		return 0
	while y > 0:
		if y & 1 == 1:
			res = res * x % p
		y = y >> 1
		x = x * x % p
	return res

def swap(a, b):
	temp = a
	a = b
	b = temp
	return (a, b)

def find(x, link):
	while x != link[x]:
		x = link[x]
	return x

def union(x, y, link, size):
	x = find(x, link)
	y = find(y, link)
	if size[x] < size[y]:
		(x, y) = swap(x, y)
	if x != y:
		size[x] += size[y]
		link[y] = x

def sieve(n):
	prime = [True for i in range(n + 1)]
	p = 2
	while p * p <= n:
		if prime[p] == True:
			for i in range(p * p, n + 1, p):
				prime[i] = False
		p += 1
	return prime
MAXN = int(1000000.0 + 5)

def spf_sieve():
	spf[1] = 1
	for i in range(2, MAXN):
		spf[i] = i
	for i in range(4, MAXN, 2):
		spf[i] = 2
	for i in range(3, ceil(MAXN ** 0.5), 2):
		if spf[i] == i:
			for j in range(i * i, MAXN, i):
				if spf[j] == j:
					spf[j] = i

def factoriazation(x):
	ret = {}
	while x != 1:
		ret[spf[x]] = ret.get(spf[x], 0) + 1
		x = x // spf[x]
	return ret

def int_array():
	return list(map(int, input().strip().split()))

def str_array():
	return input().strip().split()
MOD = int(1000000000.0) + 7
CMOD = 998244353
INF = float('inf')
NINF = -float('inf')
string = list(input().strip())
if string.count('0') == 0:
	if len(string) == 1:
		print(0)
	else:
		print(''.join(string[:-1]))
else:
	string.remove('0')
	print(''.join(string))


s = str(input())
s1 = list((i for i in s))
for i in range(len(s1)):
	if s1[i] == '0':
		s1[i] = ''
		print(''.join(s1))
		exit()
s1[0] = ''
print(''.join(s1))
exit()


st = input()
n = len(st)
if n < 3:
	print(st[0])
else:
	i = n - 1
	res = list(st)
	pt = n - 1
	while i > -1:
		if res[i] == '0':
			pt = i
		i -= 1
	res.pop(pt)
	print(''.join(res))


n = input()
if '1' not in n:
	print(n[1:])
else:
	for i in range(len(n) - 1):
		if n[i] == '0' and n[i + 1] == '1':
			print(n[:i] + n[i + 1:])
			break
	else:
		print(n[:-1])


import sys
a = sys.stdin.readline().strip()
totals = {}
max_seen = 0
max_str = a[1:]
for i in range(len(a)):
	if a[i] == '0':
		cut = a[:i] + a[i + 1:]
		max_str = cut
		break
print(max_str)


line = input()
length = len(line)
for i in range(length):
	if line[i] == '0':
		line = line[0:i] + line[i + 1:length]
		break
	elif i == length - 1:
		line = line[0:i] + line[i + 1:length - 1]
print(line)


s = input()
f_10 = s.find('10')
if f_10 >= 0:
	print(s[:f_10 + 1] + s[f_10 + 2:])
else:
	print(s[:-1])


antigo = input()
deu = False
novo = ''
for digit in antigo:
	if not deu and digit == '0':
		deu = True
	else:
		novo += digit
if not deu:
	novo = novo[:-1]
print(novo)


n = list(input())
try:
	del n[n.index('0')]
except ValueError:
	del n[0]
print(''.join(n))


s = input()
if '1' not in s:
	print(0)
elif '0' not in s:
	print(s[:-1])
else:
	for i in range(len(s)):
		if s[i] == '0':
			x = i
			break
	print(s[:i] + s[i + 1:])


z = list(input())
t = list(set(z))
if len(t) == 1 and t[0] == '1':
	print('1' * (len(z) - 1))
elif len(t) == 2:
	z.pop(z.index('0'))
	for i in z:
		print(i, end='')


digits = list(input())
l = len(digits)
pos = l - 1
for i in range(l):
	if digits[i] == '0':
		pos = i
		break
digits.pop(pos)
for d in digits:
	print(d, end='')


a = [k for k in input()]
try:
	del a[a.index('0')]
except Exception as e:
	del a[0]
print(''.join(a))


import sys
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush
from math import *
from collections import defaultdict as dd, deque, Counter as C
from itertools import combinations as comb, permutations as perm
from bisect import bisect_left as bl, bisect_right as br, bisect
from time import perf_counter
from fractions import Fraction
sys.setrecursionlimit(int(pow(10, 6)))
mod = int(pow(10, 9) + 7)
mod2 = 998244353

def data():
	return sys.stdin.readline().strip()

def out(*var, end='\n'):
	sys.stdout.write(' '.join(map(str, var)) + end)

def l():
	return list(sp())

def sl():
	return list(ssp())

def sp():
	return map(int, data().split())

def ssp():
	return map(str, data().split())

def l1d(n, val=0):
	return [val for i in range(n)]

def l2d(n, m, val=0):
	return [l1d(n, val) for j in range(m)]
t = 1
for _ in range(t):
	s = list(input())
	for i in range(len(s)):
		if s[i] == '0':
			del s[i]
			break
		if i == len(s) - 1:
			del s[-1]
	print(''.join(s))


import math
alph = 'abcdefghijklmnopqrstuvwxyz'
s = list(str(input()))
for i in range(len(s)):
	if s[i] == '0':
		del s[i]
		print(''.join(s))
		break
else:
	del s[0]
	print(''.join(s))


from sys import stdin, stdout
a = stdin.readline()
out = ''
zerocount = 0
for i in a:
	if i == '1':
		out += i
	elif i == '0':
		if zerocount == 0:
			zerocount += 1
		else:
			out += i
if zerocount == 0:
	print(a[1:])
else:
	print(out)


s = input()
if not s.count('0'):
	print(s[1:])
else:
	for i in range(len(s)):
		if s[i] == '0':
			print(s[:i] + s[i + 1:])
			exit()


s = input()
t = 'NO'
for i in range(len(s)):
	if s[i] == '0':
		t = i
		break
if t != 'NO':
	print(s[:t] + s[t + 1:])
else:
	print(s[:-1])


s = input().strip()
sl = [a for a in s]
try:
	idx = sl.index('0')
	print(s[:idx] + s[idx + 1:])
except:
	print(s[:-1])


a = input()
if a.count('0') > 0:
	x = a.index('0')
	a = a[:x] + a[x + 1:]
	print(a)
else:
	print(a[:len(a) - 1])


a = list(input())
if '0' in a:
	a.remove('0')
else:
	a.pop()
print(''.join(a))


s = str(input())
if s.count('0') != 0:
	for i in range(0, len(s)):
		if s[i] == '0':
			s = s[:i] + s[i + 1:]
			break
else:
	s = s[1:]
print(s)


s = list(input())
m = -1
for i in range(len(s)):
	if s[i] == '0':
		s[i] = ''
		m = 1
		break
if m == -1:
	s[-1] = ''
print(''.join(s))


a = str(input())
s = list(a)
l = len(s)
if s.count('1') == l:
	print(a[1:])
else:
	for i in range(l):
		if s[i] == '0':
			s.pop(i)
			print(''.join(map(str, s)))
			break


arr = list(input())
z = 0
if '0' in arr:
	z = arr.index('0')
arr.pop(z)
print(''.join(arr))


n = list(input())
p = n.count('0')
if p == 0:
	n.remove(n[0])
	''.join(n)
else:
	x = n.index('0')
	n.remove(n[x])
	''.join(n)
for i in range(len(n)):
	print(n[i], end='')


strs = input()
flag = 0
l = list()
for x in range(len(strs)):
	if strs[x] == '0':
		l = list(strs)
		l.pop(x)
		flag = 1
		break
if flag == 0:
	l = list(strs[1:])
strs = ''.join(l)
print(int(strs))


n = input()
l = list(n)
a = n.find('0')
l.remove(l[a])
print(''.join(l))


def solution():
	st = input()
	n = len(st)
	for i in range(n):
		if st[i] == '0':
			print(st[:i] + st[i + 1:])
			return
	print(st[:-1])
	return
solution()


s = [int(x) for x in input()]
n = s.count(0)
if n > 0:
	j = s.index(0)
	for i in range(len(s)):
		if i == j:
			continue
		else:
			print(s[i], end='')
else:
	for i in s[:-1]:
		print(i, end='')


num = input()
idx = num.find('0')
if idx > 0:
	print(num[:idx] + num[idx + 1:])
else:
	print(num[:-1])


s = list(input())
for i in range(len(s)):
	if s[i] == '0':
		break
del s[i]
print(''.join(s))


n = input()
sz = len(n)
f = True
c = n.count('1')
if c == sz:
	print(n[1:])
else:
	for i in range(sz):
		if n[i] == '0' and f:
			f = False
		else:
			print(n[i], end='')
print()


s = input()
l = len(s)
flag = 0
index = -1
for i in range(l):
	if s[i] == '0':
		flag = 1
		index = i
		break
if flag == 0:
	for i in range(l - 1):
		print(s[i], end='')
else:
	for i in range(index):
		print(s[i], end='')
	for i in range(index + 1, l):
		print(s[i], end='')


s = str(input())
k = ''
status = False
for i in s:
	if status == True or i != '0':
		k += i
	else:
		status = True
if status == False:
	k = s[:-1]
print(k)


n = input()
c = n.find('0')
if c == -1:
	num = n[1:]
else:
	num = n[:c] + n[c + 1:]
print(num)


binstr = list(input())
found = False
for i in range(0, len(binstr)):
	if binstr[i] == '0':
		del binstr[i]
		found = True
		break
if found:
	print(''.join(binstr))
elif len(binstr) > 0:
	print(''.join(binstr[1:]))
else:
	print(0)


n = input()
if '0' not in n:
	print(n[:-1])
else:
	s = True
	for i in range(len(n)):
		if n[i] == '0' and s:
			s = False
		else:
			print(n[i], end='')


import sys
a = sys.stdin.readline().strip()

def findMax(a):
	posZero = a.find('0')
	if posZero == -1:
		return a[:-1]
	else:
		return a[:posZero] + a[posZero + 1:]
print(findMax(a))


s = input()
l = list(s)
c = l.count('0')
if c == 0:
	for i in range(len(l) - 1):
		print(1, end='')
else:
	for i in range(len(l)):
		if l[i] == '0':
			l1 = l[:i] + l[i + 1:]
			break
	for i in l1:
		print(i, end='')


import sys
k = sys.stdin.readline()
while k:
	l = [digit for digit in k[:-1]]
	try:
		l.remove('0')
	except:
		l.pop(-1)
	print(''.join(l))
	k = sys.stdin.readline()


a = list(input())
a = list(map(int, a))
flag = 0
for i in range(len(a)):
	if a[i] == 0:
		a = a[:i] + a[i + 1:]
		flag = 1
		break
a = list(map(str, a))
if flag:
	print(''.join(a))
else:
	print(''.join(a[:-1]))


a = list(input())
if '0' in a:
	a.remove('0')
else:
	a.pop()
print(*a, sep='')


string = input()
zeros = string.count('0')
ones = string.count('1')
if zeros == 0:
	string = string[:-1]
else:
	string = string[:string.index('0')] + string[string.index('0') + 1:]
print(string)


lst = list(input())
if '0' not in lst:
	print(''.join(lst[1:]))
	exit()
for i in range(len(lst)):
	if lst[i] == '0':
		k = i
		break
z = ''
del lst[lst.index(lst[k])]
print(''.join(lst))


n = input()
k = n.count('0')
if k == 0:
	for i in range(len(n) - 1):
		print(n[i], end='')
elif k == 1:
	n = list(n)
	n.sort()
	for i in range(1, len(n)):
		print(n[i], end='')
else:
	k = 0
	for i in range(len(n)):
		if n[i] == '0' and k == 0:
			k = 1
		else:
			print(n[i], end='')


S = input()
N = len(S)
for i in range(N):
	if S[i] == '0':
		ans = S[:i] + S[i + 1:]
		print(ans)
		exit()
print(S[1:])


import sys, os, io, time, copy
if os.path.exists('input.txt'):
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('output.txt', 'w')
import math

def main():
	string = input()
	n = len(string)
	flag = 0
	for i in range(n - 1):
		if flag == 0 and string[i] == '0':
			flag = 1
			pass
		else:
			print(string[i], end='')
	if flag == 1:
		print(string[n - 1])
	else:
		print('')
main()


bn = str(input())
l = len(bn)
for i in range(l):
	if bn[i] == '0':
		break
print(bn[0:i] + bn[i + 1:])


b = input()
b_arr = []
for i in range(len(b)):
	b_arr.append(int(b[i]))
if len(b_arr) == 1:
	print(0)
else:
	flag = 0
	ind = 0
	for i in range(len(b_arr)):
		if b_arr[i] == 0:
			ind = i
			flag = 1
			break
	str1 = ''
	if flag == 0:
		for i in range(1, len(b_arr)):
			str1 += str(b_arr[i])
	else:
		for i in range(len(b_arr)):
			if i != ind:
				str1 += str(b_arr[i])
	print(str1)


bin_num = list(input())
if '0' in bin_num:
	for i in range(len(bin_num)):
		if bin_num[i] == '0':
			del bin_num[i]
			break
	print(''.join(bin_num))
else:
	del bin_num[0]
	print(''.join(bin_num))


import sys
import os
import math
t = sys.stdin.readline()
vals = t
new_number = []
first = False
for val in vals:
	if val == '0' and first == False:
		first = True
	else:
		new_number.append(val)
if first == False:
	new_number = t[1:]
	print(new_number)
else:
	out = ''.join(new_number)
	print(out)


import sys
a = sys.stdin.readline()[:-1]
i = 0
while i < len(a):
	if a[i] == '0':
		break
	i += 1
if i == len(a):
	print(a[:-1])
else:
	print(a[:i] + a[i + 1:])


s = list(input())
if s.count('0') > 0:
	del s[s.index('0')]
else:
	del s[s.index('1')]
print(*s, sep='')


s = input()
flag = 0
pole = 0
pos = -1
for i in range(len(s)):
	if s[i] == '1':
		flag = 1
	if flag and s[i] == '0':
		pos = i
		pole = 1
		break
if pole:
	print(s[:pos] + s[pos + 1:len(s)])
else:
	print(s[:len(s) - 1])


s = list(input())
if s.count('0') == 0:
	s.pop()
else:
	s.pop(s.index('0'))
print(*s, sep='')


line = str(input())
if '0' in line:
	idx = line.index('0')
	if idx + 1 < len(line):
		print(line[:idx] + line[idx + 1:])
	else:
		print(line[:idx])
else:
	print('1' * (len(line) - 1))


a = input()

def fn(a):
	if '0' in a:
		for i in range(len(a)):
			if a[i] == '0':
				return a[:i] + a[i + 1:]
	else:
		return a[1:]
print(fn(a))


l = list(input())
if len(l) == 1:
	exit()
j = 1
for i in range(len(l)):
	if l[i] == '0':
		l.pop(i)
		j = 0
		break
if j == 1:
	l.pop(0)
for i in range(len(l)):
	print(l[i], end='')


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


s = input()
arr = list(s)
boo = False
for i in range(len(arr)):
	if arr[i] == '0':
		del arr[i]
		boo = True
		break
if not boo:
	del arr[0]
for i in arr:
	print(i, end='')


from sys import stdin, stdout

def ii():
	return int(stdin.readline())

def mi():
	return map(int, stdin.readline().split())

def li():
	return list(mi())

def si():
	return stdin.readline()
bool1 = False
s = input()
for i in s[:-1]:
	if not bool1 and i == '0':
		bool1 = True
	else:
		print(i, end='')
if bool1:
	print(s[-1])


N = input()
if '0' not in N:
	print('1' * (len(N) - 1))
else:
	print(N[:N.index('0')] + N[N.index('0') + 1:])


st = input()
s = ''
n = len(st)
check = 0
for i in range(n):
	if st[i] == '0':
		s = st[:i] + st[i + 1:]
		check = 1
		break
if check == 0:
	print(st[:n - 1])
else:
	print(s)


s = input()
n = len(s)
can = False
for i in range(n):
	if s[i] == '0':
		new_s = s[:i] + s[i + 1:]
		can = True
		break
if can:
	print(new_s)
else:
	print(s[1:])


a = int(input())
s = str(a)
for i in range(len(s)):
	if s[i] == '0':
		index = i
		print(s[:i] + s[i + 1:])
		break
else:
	print(s[1:])


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


def remove_char(str, n):
	first_part = str[:n]
	last_part = str[n + 1:]
	return first_part + last_part
r = input()
a = str(r)
index = 0
check = 0
for i in a:
	if i == '0':
		check = 1
		break
	else:
		index = index + 1
if check == 1:
	print(remove_char(a, index))
else:
	print(remove_char(a, 0))


line = list(map(int, input()))
if 0 in line:
	line.remove(0)
else:
	line.remove(1)
print(''.join(list(map(str, line))))


def solve():
	a = input()
	result = ''
	for (i, ch) in enumerate(a):
		if ch == '0':
			result = a[:i] + a[i + 1:]
			break
		if i == len(a) - 1:
			result = a[:-1]
	print(result)
solve()


import re
from collections import Counter
from sys import stderr
from typing import Union, Generator, List, Tuple
import string
INF = 2e+18 + 3
EPS = 1e-10

def main():
	num = input()
	if '0' in num:
		res = num.replace('0', '', 1)
	else:
		res = num[:-1]
	print(res)
main()


def delete(arr, i):
	n = len(arr)
	for i in range(i, n - 1):
		arr[i] = arr[i + 1]
	return arr[:n - 1]
s = input()
s = list(s)
f = 1
for i in range(len(s)):
	if s[i] == '0':
		s = delete(s, i)
		f = 0
		break
if f:
	s = delete(s, len(s) - 1)
print(''.join(s))


def remove_zero(string):
	l = len(string)
	if '0' not in string:
		return string[:l - 1]
	else:
		for i in range(l):
			if string[i] == '0':
				j = i
				break
		if j != l - 1:
			return string[:j] + string[j + 1:]
		else:
			return string[:j]
s = input()
print(remove_zero(s))


def littleElephant():
	s = input()
	if s[0] == '0':
		s = s[:i] + s[i + 1:]
		print(s)
		return
	for i in range(len(s)):
		if s[i] == '0':
			s = s[:i] + s[i + 1:]
			print(s)
			return
	s = s[:0] + s[1:]
	print(s)
	return
littleElephant()


n = input()
pos = n.find('0')
if pos == -1:
	print(n[:-1])
else:
	print(n[0:pos] + n[pos + 1:])


x = list(input())
f = 0
for i in range(len(x)):
	if x[i] == '0':
		x.pop(i)
		f = 1
		break
if f == 0:
	x.pop(len(x) - 1)
print(''.join(x))


a = input()
x = len(a)
x -= 1
stat = False
l = ''
for i in a:
	if i == '1':
		l = l + i
	elif i == '0' and (not stat):
		stat = True
	else:
		l = l + i
for i in range(0, x):
	print(l[i], end='')


n = input()
n = list(n)
if n.count('0') == 0:
	print(''.join(map(str, n[0:len(n) - 1])))
else:
	a = n.index('0')
	n.remove(n[a])
	print(''.join(map(str, n)))


n = input()
l = len(n)
for idx in range(l):
	if n[idx] == '0':
		break
print(n[:idx] + n[idx + 1:])


s = int(input())
f = str(s)
l = list(f)
if '0' not in l:
	l.remove(l[0])
else:
	for i in range(len(l)):
		if l[i] == '0':
			l.remove(l[i])
			break
x = ''.join(l)
print(x)


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))


l = list(map(int, input()))
try:
	l.remove(0)
	print(''.join(map(str, l)))
except:
	l.remove(1)
	print(''.join(map(str, l)))


s = input()
for i in range(len(s) - 1):
	if s[i] == '1':
		print(s[i], end='')
	else:
		print(s[i + 1:])
		break


n = input()
if '0' in n:
	print(n[:n.index('0')] + n[n.index('0') + 1:])
else:
	print(n[:-1])


def answer(a):
	al = list(a)
	if al.count('0') == 0:
		al.pop()
		return ''.join(al)
	indx = al.index('0')
	al.pop(indx)
	return ''.join(al)

def main():
	a = input()
	print(answer(a))
	return
main()


n = int(input())
n = str(n)
l = []
if n.count('0') != 0 and n.count('0') != len(n):
	for i in range(len(n)):
		if n[i] == '0':
			x = n[0:i] + n[i + 1:len(n)]
			l.append(x)
			break
	for i in range(len(n) - 1, -1, -1):
		if n[i] == '0':
			x = n[0:i] + n[i + 1:len(n)]
			l.append(x)
			break
	if bin(int(l[0])) > bin(int(l[1])):
		print(l[0])
	else:
		print(l[1])
elif n.count('0') == len(n):
	print(0)
else:
	x = n[0:len(n) - 1]
	print(x)


def main():
	string = str(input())
	string = list(string)
	minus = 0
	for i in range(len(string)):
		if string[i] == '0':
			string[i] = '-1'
			minus = 1
			break
	if minus == 0:
		string[-1] = '-1'
	for x in string:
		if x != '-1':
			print(x, end='')
main()


str1 = input()
if str1.count('0') == 0:
	for i in range(len(str1) - 1):
		print('1', end='')
else:
	index = -1
	for i in range(len(str1)):
		if str1[i] == '0':
			index = i
			break
	for i in range(len(str1)):
		if index != i:
			print(str1[i], end='')
print()


n = input()
num = list(n)
i = 0
flag = False
while i < len(num):
	if num[i] == '0':
		num.pop(i)
		flag = True
		break
	i += 1
if not flag:
	num.pop(len(num) - 1)
flag = num[0] == '1'
for i in num:
	if i == '0' and (not flag):
		continue
	if i == '1' and (not flag):
		flag = True
	print(i, end='')


S = input()
c = 0
for i in range(len(S) - 1):
	if S[i] == '0':
		print(S[:i] + S[i + 1:])
		c = 1
		break
if c == 0:
	print(S[:len(S) - 1])


s = input()
for i in s:
	if i == '0':
		print(s[:s.index(i)], s[s.index(i) + 1:], sep='')
		exit()
print(s[1:])


s = input()
l = list(s)
z = l.count('0')
if z == 0:
	l.remove(l[0])
	for i in l:
		print(i, end='')
else:
	for i in l:
		if i == '0':
			l.remove(i)
			break
	for i in l:
		print(i, end='')


n = input()
bits = [i for i in n]
f0 = -1
try:
	f0 = bits.index('0')
	bits.pop(f0)
except:
	bits.pop()
n = ''.join(bits)
print(n)


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


li = list(map(int, input()))
n = len(li)
st = False
if 0 in li:
	li.remove(0)
	print(*li, sep='')
else:
	li.pop()
	print(*li, sep='')


import operator as op
import re
import sys
from bisect import bisect, bisect_left, insort, insort_left
from collections import Counter, defaultdict, deque
from copy import deepcopy
from decimal import Decimal
from functools import reduce
from itertools import accumulate, combinations, combinations_with_replacement, groupby, permutations, product
from math import acos, asin, atan, ceil, cos, degrees, factorial, gcd, hypot, log2, pi, radians, sin, sqrt, tan
from operator import itemgetter, mul
from string import ascii_lowercase, ascii_uppercase, digits

def inp():
	return int(input())

def inlist():
	return list(map(int, input().split()))

def instr():
	s = input()
	return list(s[:len(s)])

def invr():
	return map(int, input().split())

def def_value():
	return 0
s = input()
pos = 0
for i in range(len(s)):
	if s[i] == '0':
		pos = i
		break
for i in range(len(s)):
	if i == pos:
		continue
	print(s[i], end='')


n = input()
A = [char for char in n]
index = len(A) + 1
for i in range(len(A)):
	if A[i] == '0':
		index = i
		break
p = []
for i in range(len(A)):
	if i != index:
		p.append(A[i])
x = ''.join(p)
if index == len(A) + 1:
	A.pop()
	print(''.join(A))
else:
	print(x)


s = input()
flag = False
for z in range(len(s)):
	if s[z] == '0':
		s = s[:z] + s[z + 1:]
		flag = True
		break
if flag:
	print(s)
else:
	print(s[1:])


s = list(input())
if '0' in s:
	zero = s.index('0')
	s.pop(zero)
	print(*s, sep='')
else:
	s.pop(-1)
	print(*s, sep='')


t = list(input())
if t.count('0') > 0:
	for i in t:
		if i == '0':
			t.remove(i)
			break
	print(''.join((j for j in t)))
elif len(t) > 1:
	print(''.join((j for j in t[:-1])))
else:
	print(0)


a = str(input())
k = 0
b = a.count('0')
if b == 0:
	a = list(a)
	del a[0]
	for i in range(len(a)):
		print(a[i], end='')
elif b == 1:
	for i in range(len(a)):
		if a[i] != '0':
			print(a[i], end='')
else:
	for i in range(len(a)):
		if a[i] == '0':
			k = i
			break
	a = list(a)
	del a[k]
	for i in range(len(a)):
		print(a[i], end='')


s = list(input())
if s.count('0') == 0:
	print('1' * (len(s) - 1))
else:
	s.remove('0')
	print(''.join((i for i in s)))


def solve(a):
	for i in range(len(a)):
		if a[i] == '0':
			return a[0:i] + a[i + 1:]
	return a[1:]
print(solve(input()))


L = list(input())
if L.count('0') > 0:
	for i in L:
		if i == '0':
			L.remove(i)
			break
else:
	del L[0]
print(''.join(L))


found = False
bits = input()
topr = []
for i in range(len(bits)):
	if bits[i] == '0' and (not found):
		found = True
		continue
	else:
		topr.append(bits[i])
if not found:
	topr.pop()
for char in topr:
	print(char, end='')
print()


x = input()
a = [int(n) for n in str(x)]
if a.count(0) != 0:
	del a[a.index(0)]
else:
	del a[0]
for n in a:
	print(n, end='')


s = input()
arr = []
firstZero = 1
sets = 0
if s.count('0') > 0:
	for i in range(0, len(s)):
		arr.append(s[i:i + 1])
		if firstZero > 0 and s[i:i + 1] == '0':
			sets = i
			firstZero -= 1
	arr.pop(sets)
else:
	for i in range(0, len(s)):
		arr.append(s[i:i + 1])
	arr.pop(0)
print(''.join(arr))


num = input()
numa = [i for i in num]
mem = [i for i in num if i == '1']
if mem == numa:
	numa.remove('1')
else:
	numa.remove('0')
print(''.join(numa))


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))


str = input()
target = -1
for index in range(0, len(str)):
	if str[index] == '0':
		target = index
		break
if target == -1:
	str = str[:-1]
	print(str)
else:
	answer = str[:target] + str[target + 1:]
	print(answer)


i = input()
index = i.find('0')
if index == -1:
	print(i[1:])
else:
	print(''.join(i[:index] + i[index + 1:]))


from sys import stdin, stdout
n = str(stdin.readline().strip())
ok = True
i = 1
for x in n:
	if ok and i == len(n):
		continue
	if x == '0' and ok:
		ok = False
		continue
	else:
		stdout.write(x)
	i = i + 1


n = input().strip()
p = n
for i in range(len(n)):
	if n[i] == '0':
		n = n[0:i] + n[i + 1:]
		break
if p == n:
	print(n[0:len(n) - 1])
else:
	print(n)


s = input().strip()
print(s[:-1]) if '0' not in s else print(s[:s.index('0')] + s[s.index('0') + 1:])


a = list(map(int, input()))
l = len(a)
z = 1
for i in range(l):
	if a[i] == 0:
		del a[i]
		break
for i in range(l - 1):
	z = a[i]
	print(z, end='')


s = list(input().strip())
if '0' not in s:
	print(''.join(s[1:]))
else:
	for i in range(len(s)):
		if s[i] == '0':
			s.pop(i)
			break
	print(''.join(s))


import sys
sys.setrecursionlimit(10 ** 5 + 1)
inf = int(10 ** 20)
max_val = inf
min_val = -inf
RW = lambda : sys.stdin.readline().strip()
RI = lambda : int(RW())
RMI = lambda : [int(x) for x in sys.stdin.readline().strip().split()]
RWI = lambda : [x for x in sys.stdin.readline().strip().split()]
s = list(input())
if '0' in s:
	s.remove('0')
else:
	s.remove('1')
print(''.join(s))


a = input()
i = 0
n = len(a)
while i < n and a[i] != '0':
	i += 1
if i == n:
	answer = a[:n - 1]
else:
	answer = a[:i] + a[i + 1:]
print(answer)


n = input()
s = list(n)
if s[0] == '0':
	del s[0]
	print(''.join(s))
else:
	for i in range(len(s)):
		if s[i] == '0':
			s[i] = ''
			break
		elif i == len(s) - 1:
			s[i] = ''
	print(''.join(s))


ss = input()
if '0' in ss:
	s = ss.index('0')
	ss = ss.replace(ss[s], '', 1)
else:
	ss = ss[1:]
print(ss)


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


a = list(input())
if a.count('0') == 0:
	print('1' * (len(a) - 1))
else:
	z = a.index('0')
	a.pop(z)
	print(''.join(a))