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.
import java.util.Scanner;

public class DigitSum {
    public static void main(String[] args) {

        Scanner scanner=new Scanner(System.in);
        int testCase=scanner.nextInt();
        int [] temp=new int[testCase];
         for(int i=0;i<testCase;i++){
             temp[i]=scanner.nextInt();
         }
         for(int i=0;i<temp.length;i++){
             System.out.println(solve(temp[i]));
         }

    }

    private static int solve(int val){
        if(val==1)return 0;
        if(val<=8) return val;
        int res=val/10;
          if(val%10==9){
              res=res+1;
          }
        return res;
    }


}
