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.io.*;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
import java.util.Collections;
import java.util.StringTokenizer;

public class Main {
	static int check(int x, int y) {
		return (x & ~y);
	}
	public static void main(String[] args) {
		int ttt = 1;
		ttt= rint();
		for (int zxc=0; zxc<ttt; zxc++) {
			long n = rint() + 1;
			System.out.println(n/10);
		}
	}

	static void sort(int[] a) {
		//Use Collections.sort(); for ArrayList
		ArrayList<Integer> l=new ArrayList<>();
		for (int i:a) l.add(i);Collections.sort(l);
		for (int i=0; i<a.length; i++) a[i]=l.get(i);
	}

	static BufferedReader br=new BufferedReader(new InputStreamReader(System.in));static StringTokenizer st=new StringTokenizer("");
	static String rstr() {while (!st.hasMoreTokens()){try {st=new StringTokenizer(br.readLine());} catch (IOException e) {e.printStackTrace();}}return st.nextToken();}
	static String rline(){try{return br.readLine(); } catch(IOException e) {} return "";}
	static int rint() {return Integer.parseInt(rstr());}
	static int[] rA(int n) {int[] a=new int[n];for (int i=0; i<n; i++){a[i]=rint();}return a;}
	static long rlong() {return Long.parseLong(rstr());}
	static double rdouble(){return Double.parseDouble(rstr());}
}
