20240721

# def neg():
#     n = int(input())
#     if n > 0:
#         print(n)
#     else:
#         print(-n)
#
# neg()

# # 1610
# def alphabet():
#     data = input()
#     n, m = map(int, input().split())
#     print(data[n:n+m])        # 변수[시작점:끝내고 싶은 칸 +1]
#
# alphabet()

# 1620
# def jaritsu():
#     num = int(input())
#     use = 0
#     for i in range(10000000):
#         if use < 10:
#             break
#         else:
#             use +=
#
# jaritsu()

# def deci():
#     number = float(input())
#     two = int(number)
#     real = number - two
#     print("%.14f" % (real), end='')
#
# deci()

# def v(k):
#     answer = 0
#     while True:
#         answer += (k % 10)
#         k //= 10
#         if k <= 0:
#             return answer
#
# n = int(input())
# print(v(n))

# # 1620 the killer hard question
# def v(k):
#     answer = 0
#     while True:     # for 'one' number. I have to repeat this until the number is first place only
#         answer += (k % 10)  # add each 자릿수 to answer
#         k //= 10    # making the number smaller 자릿수 after adding to answer, every time
#         if k <= 0:  # if 자릿수 is all depleted, submit as answer
#             if answer < 10:
#                 return answer
#             k = answer
#             answer = 0
#
# n = int(input())
# print(v(n))

# unsolved (wrong answer ver 1)
# def number():
#     number = int(input())
#     saved = 0
#     for i in range(number()):
#         number / 10 ** i 20
#
# # unsolved (wrong answer ver 2)
# def number():
#     number = int(input())
#     saved = 0
#     howlong = 0
#     for i in range(10): # for checking 자릿수
#         if number / 10**i:
#             howlong = i
#     print(howlong)
#
#     for i in range(10000000):  # for the length of number
#         if number < 10:  # so first if it's first place just print it and end loop
#             print(number)
#             break
#         elif i == len(number):
#             saved = number
#         else:
#             saved += number // (10 ** i)    # save each digit from the number
#
# number()

# # 1602
# def opposite():
#     n = input()
#     if n[0] == '-':
#         print(n[1:len(n)])
#     else:
#         print(n)
#
# opposite()