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.Arrays;
  import java.util.Random;
  import java.util.StringTokenizer;
  
  public class A {
  
      public static void main(String[] args) {
          FastReader scan = new FastReader();
          PrintWriter out = new PrintWriter(System.out);
          Task solver = new Task();
          int t = scan.nextInt();
          for(int tt = 1; tt <= t; tt++) solver.solve(tt, scan, out);
          out.close();
      }
  
      static class Task {
  
          public void solve(int testNumber, FastReader scan, PrintWriter out) {
              int n = scan.nextInt();
              int ans = n / 10;
              if(n % 10 == 9) ans++;
              out.println(ans);
          }
  
          int sum(int n) {
              int ans = 0;
              while(n > 0) {
                  ans += n % 10;
                  n /= 10;
              }
              return ans;
          }
      }
  
      static void ruffleSort(int[] a) {
          Random get = new Random();
          for (int i = 0; i < a.length; i++) {
              int r = get.nextInt(a.length);
              int temp = a[i];
              a[i] = a[r];
              a[r] = temp;
          }
          Arrays.sort(a);
      }
  
      static void ruffleSort(long[] a) {
          Random get = new Random();
          for (int i = 0; i < a.length; i++) {
              int r = get.nextInt(a.length);
              long temp = a[i];
              a[i] = a[r];
              a[r] = temp;
          }
          Arrays.sort(a);
      }
  
      static class FastReader {
          BufferedReader br;
          StringTokenizer st;
  
          public FastReader() {
              br = new BufferedReader(new InputStreamReader(System.in));
          }
  
          public FastReader(String s) throws FileNotFoundException {
              br = new BufferedReader(new FileReader(new File(s)));
          }
  
          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;
          }
      }
  
  }