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.*;
  import java.lang.*;
  
  public class Main {
      static long mod = (long) Math.pow(10, 9) + 7;
  
      public static void main(String[] args) throws IOException {
          FastReader sc = new FastReader();
          StringBuilder fout = new StringBuilder();
  
          int t = sc.nextInt();
          while (t-- != 0) {
              int n = sc.nextInt();
              //int[] a =new int[n];
              int ans=0;
              if(n%10==9)
              {
                  ans=1;
              }
              ans+=n/10;
              System.out.println(ans);
  
          }
  
      }
  
      static void print(long[] arr) {
          for (long l : arr) System.out.print(l + " ");
      }
  
      static void print(int[] arr) {
  
          for (int l : arr) System.out.print(l + " ");
  
      }
  
      static long gcd(long a, long b) {
          if (a == 0)
              return b;
          return gcd(b % a, a);
      }
  
      static void no() {
          System.out.println("NO");
      }
  
      static void yes() {
          System.out.println("YES");
      }
  
      static class Pair {
          int  a,b;
  
          public Pair(int a, int b) {
              this.a = a;
              this.b = b;
          }
      }
  
      public 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;
          }
      }
  
  }
  