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

public class Main {
    static double dist(Point p, Point q){
        return Math.abs(p.x - q.x) + Math.abs(p.y - q.y);
    }
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int t = in.nextInt();
        for (int i = 0; i < t; i++) {
            int n = in.nextInt();
            int res = n/10;
            if(n%10 == 9){
                res++;
            }
//            int cnt = 0;
//            for (Integer j = 1; j <= n; j++) {
//                int sum = j.toString().chars().map(c -> Character.digit(c, 10)).sum();
//                Integer j2 = j+1;
//                int sum2 = j2.toString().chars().map(c -> Character.digit(c, 10)).sum();
//                if(sum2<sum){
//                    cnt++;
//                    System.out.println(j);
//                }
//            }
            System.out.println(res);
        }
    }
}