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

public class P03 {
    
	static class FastReader{
		BufferedReader br ;
		StringTokenizer st;
		public FastReader() {
			br = new BufferedReader(new InputStreamReader(System.in));
			
		}
		String next() {
			while(st==null || !st.hasMoreElements()) {
				try {
					st = new StringTokenizer(br.readLine());
				}catch(IOException e) {
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}
		
		int nextInt() {
			return Integer.parseInt(next());
		}
		
		long nextLong() {
			return  Long.parseLong(next());
		}
		
		double nextDouble() {
			return Double.parseDouble(next());
		}
		
		float nextFloat() {
			return Float.parseFloat(next());
		}
		String nextLine() {
			String str = "";
			try {
				str = br.readLine();
			}catch(IOException e) {
				e.printStackTrace();
			}
			return str ;
		}
	}
	
	private static long gcd(long l, long m) {
		// TODO Auto-generated method stub
		if(m==0) {
			return l;
		}
		return gcd(m,l%m);
	}
	static void swap(long[] arr, int i, int j)
	{
	    long temp = arr[i];
	    arr[i] = arr[j];
	    arr[j] = temp;
	}

	static int partition(long[] arr, int low, int high)
	{	   
	    long pivot = arr[high];   
	    int i = (low - 1);
	    for(int j = low; j <= high - 1; j++)
	    {    
	        if (arr[j] < pivot)
	        {          
	            i++;
	            swap(arr, i, j);
	        }
	    }
	    swap(arr, i + 1, high);
	    return (i + 1);
	}
	static void quickSort(long[] arr, int low, int high)
	{
	    if (low < high)
	    {  
	        int pi = partition(arr, low, high);
	        quickSort(arr, low, pi - 1);
	        quickSort(arr, pi + 1, high);
	    }
	}
	static long M = 1000000007;
	static long powe(long a,long b) {
		long res =1;
		while(b>0) {
			if((b&1)!=0) {
				res=(res*a)&M;
			}
			a=(a*a)%M;
			b>>=1;
		}
		return res;
	}
	static long power(long x, long y, long p)  {
	    long res = 1; 	 
	    x = x % p; 	 
	    if (x == 0)
	      return 0; 	 
	    while (y > 0)
	    {	 	      
	      if ((y & 1) != 0)
	      res = (res * x) % p;	 	    
	      y = y >> 1; 
	      x = (x * x) % p;
	    }
	    return res;
	  }
	static boolean [] seive(int n) {
		boolean a[] = new boolean[n+1];
		Arrays.fill(a, true);
		a[0]=false;
		a[1]=false;
		for(int i =2;i<=Math.sqrt(n);i++) {
			for(int j =2*i;j<=n;j+=i) {
				a[j]=false;
			}
		}
		
		return a;
	}
	
	//MAIN FUNCTION ------->
	public static void main(String[] args) throws IOException {
		FastReader fs = new FastReader();
		int t = fs.nextInt();
		while(t-->0) {
			int n = fs.nextInt();
			n++;
			System.out.println(n/10);
		}
   
   }

	private static int checkap(long[][] a) {
		int c=0;
		if(((a[0][0]+a[0][2])/2)==a[0][1])c++;
		if(((a[1][0]+a[1][2])/2)==a[1][1])c++;
		if(((a[2][0]+a[2][2])/2)==a[2][1])c++;
		if(((a[0][0]+a[2][0])/2)==a[1][0])c++;
		if(((a[0][1]+a[2][1])/2)==a[1][1])c++;
		if(((a[0][2]+a[2][2])/2)==a[1][2])c++;
		if(((a[0][0]+a[2][2])/2)==a[1][1])c++;
		if(((a[2][0]+a[0][2])/2)==a[1][1])c++;
		return c;
	}
	private static void sizesort(String[] s) {
		// TODO Auto-generated method stub
		for(int i =0;i<s.length-1;i++) {
			for(int j =i+1;j<s.length;j++) {
				if(s[j].length()<s[i].length()) {
					swapstr(s,i,j);
				}
			}
			
		}
		
	}

	private static void swapstr(String[] s, int i, int j) {
		String temp  = s[i];
		s[i]=s[j];
		s[j]= temp;
		
	}
		
	
	
}



