description: 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.
solution: 	import java.io.*;
  	import java.util.*;
  	
  	public class A {
  	
  		public static void main(String[] args) {
  			
  			FastReader f = new FastReader();
  			StringBuffer sb=new StringBuffer();
  			
  			int test=f.nextInt();
  			while(test-->0)
  			{
  				int n=f.nextInt();
  				int ans=n/10;
  				int mod=n%10;
  				if(mod==9)
  					ans++;
  				sb.append(ans+"\n");
  			}
  			System.out.println(sb);
  		}
  		
  		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()); 
  		    } 
  		    String nextLine() { 
  		        String str = ""; 
  		        try{ 
  		            str = br.readLine(); 
  		        } 
  		        catch (IOException e) { 
  		            e.printStackTrace(); 
  		        } 
  		        return str; 
  		    } 
  		} 
  	}
  