Let's define S(x) to be the sum of digits of number x written in decimal system. For example, S(5) = 5, S(10) = 1, S(322) = 7.

We will call an integer x interesting if S(x + 1) < S(x). In each test you will be given one integer n. Your task is to calculate the number of integers x such that 1 ≤ x ≤ n and x is interesting.

Input

The first line contains one integer t (1 ≤ t ≤ 1000) — number of test cases.

Then t lines follow, the i-th line contains one integer n (1 ≤ n ≤ 10^9) for the i-th test case.

Output

Print t integers, the i-th should be the answer for the i-th test case.

Example

Input


5
1
9
10
34
880055535


Output


0
1
1
3
88005553

Note

The first interesting number is equal to 9.
# def numbers_sum(number):
#     result = 0
#     for digit in str(number):
#         result += int(digit)
#     return result
#
#
# t = int(input())
# n = []
# for _ in range(t):
#     n.append(int(input()))
# for max_number in n:
#     counter = 0
#     for i in range(1, max_number + 1):
#         if numbers_sum(i + 1) < numbers_sum(i):
#             counter += 1
#     print(counter)
t = int(input())
n = []
for _ in range(t):
    n.append(int(input()))
for number in n:
    if len(str(number)) < 2:
        counter = number // 9
    else:
        counter = number // 10
    print(counter)



