Определить сколькими способами можно восстановить изначальную надпись

n=int(input())
 
s=str(n)
ls=len(s)
c=0
for i in range(1,ls):
    h=s[0:i]
    t=s[i:]
    if int(t) >= int(h):
        c+=1
    else:
        break
print(c)

n = int(input())
s = str(n)
ls = len(s)
c = 0
for i in range(1, ls):
    h = s[0:i]
    t = s[i:]
    if str(str(h)[-1]) == 0 or str(str(h)[-1]) == "0":
        c = c - 1
    if int(t) >= int(h):
        c += 1
    else:
        break
print(c)

n = int(input())
s = str(n)
ls = len(s)
c = 0
if ls % 2 != 0:
    ls = ls - 1
c = ls / 2
a = str(n)
b = (a.count('0'))
d = round(c - b)
if d < 0:
    d = 0
print(d)

n = int(input())
 
s = str(n)
ls = len(s)
c = 0
for i in range(1, ls):
    h = s[0:i]
    t = s[i:]
    if t[0] == '0':
        continue
    if int(t) >= int(h):
        c += 1
    else:
        break
print(c)

# n = input()
n = '73402748237480' * 20000
res = 0
if len(n) > 1:
    middle = len(n) // 2
    while int(n[:middle]) > int(n[middle:]) or n[middle] == '0':
        middle -= 1
    res = len(n[:middle]) - n[:middle].count('0')
print(res)

# n = input()
n = '1' + '0' * 200000 + '1'
res = 0
if len(n) > 1:
    middle = len(n) // 2
    while (n[middle] == '0' or int(n[:middle]) > int(n[middle:])) and middle > 1:
        middle -= 1
    res = len(n[:middle]) - n[:middle].count('0')
print(res)

# n = input()
# n = '1' + '0' * 20 + '1'
n = '97'
res = 0
if len(n) == 2 and int(n[0]) <= int(n[1]):
    res = 1
elif len(n) > 2:
    middle = len(n) // 2
    while (n[middle] == '0' or int(n[:middle]) > int(n[middle:])) and middle > 1:
        middle -= 1
    res = len(n[:middle]) - n[:middle].count('0')
print(res)

def f(s):
    ls = len(s)
    c = 0
    for i in range(1, ls):
        h = s[0:i]
        t = s[i:]
        if t[0] == '0':
            continue
        if int(t) >= int(h):
            c += 1
        else:
            break
    return c
 
 
# n = input()
# n = '1' + '0' * 200000 + '1'
arr = [str(i) for i in range(10000, 100000)]
 
for n in arr:
    res = 0
    if len(n) > 1:
        middle = len(n) // 2
        while n[middle] == '0' or middle > 0 and int(n[:middle]) > int(n[middle:]):
            middle -= 1
        res = len(n[:middle]) - n[:middle].count('0')
    print(res)
 
    expected = f(n)
    assert res == expected, f'{res} != {expected} (Не совпало на числе: {n})'

s = input()
n = len(s)
count = 0
i = 1
while i < n - i:
    if s[i] != '0':
        count += 1
    i += 1
if n % 2 == 0:
    if int(s[:i]) <= int(s[i:]):
        count += 1
print(count)

while n[middle] == '0'

n = input()
res = 0
if len(n) > 1:
    middle = len(n) // 2
    while n[middle] == '0' or middle > 0 and int(n[:middle]) > int(n[middle:]):
        middle -= 1
    res = len(n[:middle]) - n[:middle].count('0')
print(res)