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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.*;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

public class java1 {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskB solver = new TaskB();
        solver.solve(1, in, out);
        out.close();
    }
    static class TaskB {

        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int t=in.nextInt();
            while(t-- >0)
            {
            	long n=in.nextLong();
            	if(n==9)
            	{
            		out.println("1");
            		
            	}
            	else
            	{
            	out.println(n/10);
            	}
            	
            			
            }
        }
        static void ruffle_sort(int[] a) {
    		//shandom_ruffle
    		Random r=new Random();
    		int n=a.length;
    		for (int i=0; i<n; i++) {
    			int oi=r.nextInt(i);
    			int temp=a[i];
    			a[i]=a[oi];
    			a[oi]=temp;
    		}
    		
    		//sort
    		Arrays.sort(a);
    	}
        
    }
    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }
        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }
        public int nextInt() {
            return Integer.parseInt(next());
        }
        public long nextLong() {
            return Long.parseLong(next());
        }
        public int[] inputarInt(int n)
        {
        	int ar[]=new int[n];
        	for(int x=0;x<n;x++)
        	{
        		ar[x]=nextInt();
        	}
        	return ar;
        }
        public long[] inputarLong(int n)
        {
        	long ar[]=new long[n];
        	for(int x=0;x<n;x++)
        	{
        		ar[x]=nextLong();
        	}
        	return ar;
        }
    }
}