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.
/* package codechef; // don't place package name! */

import java.util.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
public class Main
{
    static int mod = 998244353 ;
    static int factorial(int n){    
      if (n == 0)    
        return 1;    
      else    
        return(n * factorial(n-1))%mod;    
    }    
    
	public static void main (String[] args) throws java.lang.Exception
	{
        // uncomment this line if you want to use the txt file to take input
        //FileReader fr=new FileReader("D:\\test.txt");    
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        int t = Integer.parseInt(br.readLine());
        while(t-- != 0){
            int n = Integer.parseInt(br.readLine());
            
            int ans = n/10;
            if(n%10 == 9) ans++;
            System.out.println(ans);
            
        }
	}
	
}
