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.util.*;
  import java.io.*;
  import java.math.BigInteger;
  import java.time.Clock;
  import java.time.ZoneId;
  import javafx.util.Pair;
  import jdk.nashorn.internal.ir.BreakNode;
  
  public class Working {
  
      static BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
      static StringBuilder out = new StringBuilder();
      static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
      static PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));
  
      static int I(String s) {
          return Integer.parseInt(s);
      }
  
      static long L(String s) {
          return Long.parseLong(s);
      }
  
      static double D(String s) {
          return Double.parseDouble(s);
      }
  
      static String[] SA() throws IOException {
          return bf.readLine().split(" ");
      }
  
      public static void main(String[] args) throws IOException {
          
   //   A    
          int t=I(bf.readLine());
  while(t-->0){
  int n=I(bf.readLine());
  if(n%10==9)n++;
      System.out.println(n/10);
  }
  
      }
  
  }
  