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 codeForces.harbourSpace;

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;

public class DigitsSum{
	public static void main(String args[]) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int t = Integer.parseInt(br.readLine().trim());
		StringBuilder sb = new StringBuilder();
		for(int i = 0;i < t; i++){
			sb.append(getInterestingNumber(Integer.parseInt(br.readLine().trim()))).append('\n');
		}
		br.close();
		System.out.println(sb);
	}

	private static int getInterestingNumber(int n){
		// ArrayList<Integer> arr = new ArrayList<>();
		// for(int i = 1; i < 1000; i++){
		// 	if(getSum(i) > getSum(i+1)) {
		// 		arr.add(i);
		// 	}
		// }
		// System.out.println(arr);
		if(n < 9) return 0;
		if(n == 9) return 1;
		return n/10;
	}

	private static int getSum(int n){
		int sum = 0;
		while(n > 0){
			sum += n%10;
			n/= 10;
		}
		return sum;
	}
}