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) {
  // 	    try {
  // 			System.setIn(new FileInputStream("input.txt"));
  // 			System.setOut(new PrintStream(new FileOutputStream("output.txt")));
  // 		} catch (Exception e) {
  // 			System.err.println("Error");
  // 		}
  		// Scanner sc = new Scanner(System.in);
  		// int t=sc.nextInt();
  		// t=1;
  		Solver s=new Solver();
  		s.solve();
  		
  	}
  }
  
  class Solver{
  	Scanner sc;
      Solver(){
      	sc = new Scanner(System.in);
      }
      
      
       // int count(int[] arr,int v){
       // 	int cnt=0,ans=0;
       // 	int i=0,j=0;
       // 	while(i<arr.length&&j<arr.length){
       // 		if(arr[j]==1){j++;cnt++;}else{i=j;cnt=0;j++;}
       // 		if(cnt==v){ans++;cnt--;i++;}
       // 	}
       // 	return ans;
       // }
       
  
      void func(){
      	
      	int n=sc.nextInt();
      	int ans=(n%10==9)?n/10+1:n/10;
      	
       System.out.println(ans);
  
      }
  
      void solve(){
      	int t=sc.nextInt();
      	// int t=1;
      	while(t>0){
  			t--;
  			func();
  		}
      }
  
  }