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 Main {
      public static void main(String[] args) {
          InputStream inputStream = System.in;
          OutputStream outputStream = System.out;
          InputReader in = new InputReader(inputStream);
          PrintWriter out = new PrintWriter(outputStream);
          TaskA solver = new TaskA();
          int t = in.nextInt();
          for (int i = 1; i <= t ; i++) {
              solver.solve(1, in, out);
          }
  //        solver.solve(1, in, out);
          out.close();
      }
  
      static class TaskA {
  //        static boolean[] primes;
  //        static {
  //            primes = new boolean[1000000];
  //            primes[2] = true;  // mark 2 as prime number
  //            primes[1] = false; // mark 1 as non-prime
  //
  //            // mark all odd numbers as primes
  //            for (int i = 3; i <= 100009 ; i += 2) {
  //                primes[i] = true;
  //            }
  //
  //            // mark all multiples of primes as non-primes
  //            for (int i = 3; i <= 100009; i += 1) {
  //                if (primes[i]) {
  //                    for (int j = i * i; j <= 100009; j += i) {
  //                        if (j > 0)
  //                            primes[j] = false;
  //                        else break;
  //                    }
  //                }
  //            }
  //        }
          public void solve(int testNumber, InputReader in, PrintWriter out) {
              long n = Long.parseLong(in.next());
              out.println((n + 1) / 10);
  
          }
      }
  
      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());
          }
  
      }
  }
  