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 main():
    for i in range(num()):
        solve()


def solve():    
    n = num()
    if n > 9:
        if str(n)[-1] == 9:
            print(n//10+1)
        else:
            print(n//10)
    else:
        if n == 9:
            print(1)
        else:
            print(0)



import itertools
import bisect, math
import copy
import fractions


def s(e): return sum(e)
def l(e): return len(e)
def num(): return int(input()) 
def array(): return list(map(int, input().split()))
def pair(): return (map(int, input().split()))
def p(x="", end = "\n"): return print(x, end = end)
def sort(a): return sorted(a)
def fpair(x): return str(fractions.Fraction(x)).split("/")

def nined(s):
    print("{:.9f}".format(s))

def parray(a):
    for i in a:
        p(i, end = " ")
    p()


def sumx(x):
    if x%2==0:
        return ((x+1)*(x//2))
    else:
        return (x+1)*((x-1)//2) + (x+1)//2
main()