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 {
      static FastScanner fs;
      static PrintWriter pw;
  
      public static void main(String[] args) {
          fs = new FastScanner();
          pw = new PrintWriter(System.out);
          int t = fs.nextInt();
          while (t-- > 0)
              solve();
          pw.close();
      }
  
      public static void solve() {
          int n = fs.nextInt();
          pw.println((n+1)/10);
      }
  
      static long pow(long b, long exp, long mod) {
          long ret = 1;
          while (exp > 0) {
              if ((exp & 1) > 0)
                  ret = (ret * b) % mod;
              b = (b * b) % mod;
              exp >>= 1;
          }
          return ret;
      }
  
      static int nCrmod(int n, int r, int mod) {
          if (r > n)
              return 0;
          if (n - r > r)
              r = n - r;
          int[] SPF = new int[n + 1];
          for (int i = 1; i <= n; i++)
              SPF[i] = i;
          for (int i = 4; i <= n; i += 2)
              SPF[i] = 2;
          for (int i = 3; i * i < n + 1; i += 2) {
              if (SPF[i] == i) {
                  for (int j = i * i; j < n + 1; j += i)
                      if (SPF[j] == j) {
                          SPF[j] = i;
                      }
              }
          }
          Map<Integer, Integer> prime_pow = new HashMap<>();
          for (int i = r + 1; i < n + 1; i++) {
              int t = i;
              while (t > 1) {
                  prime_pow.put(SPF[t],
                          prime_pow.getOrDefault(SPF[t], 0) + 1);
                  t /= SPF[t];
              }
          }
          for (int i = 1; i < n - r + 1; i++) {
              int t = i;
              while (t > 1) {
                  prime_pow.put(SPF[t], prime_pow.get(SPF[t]) - 1);
                  t /= SPF[t];
              }
          }
          long ans = 1;
          for (int i : prime_pow.keySet())
              ans = (ans * pow(i, prime_pow.get(i), mod)) % mod;
          return (int) ans;
      }
  
      //    static int k;
  //    static int par(int curr) {
  //        return (1<<k)-1-(((1<<k)-1-curr)/2);
  //    }
  //    static int left(int curr) {
  //        return (1<<k)-1-(2*((1<<k)-1-curr)+1);
  //    }
  //    static int right(int curr) {
  //        return (1<<k)-1-(2*((1<<k)-1-curr));
  //    }
      static int gcd(int a, int b) {
          if (a == 0) return b;
          return gcd(b % a, a);
      }
  
      static void ruffleSort(int[] a) {
          int n = a.length;//shuffle, then sort
          for (int i = 0; i < n; i++) {
              int oi = random.nextInt(n), temp = a[oi];
              a[oi] = a[i];
              a[i] = temp;
          }
          Arrays.sort(a);
      }
  
      static final Random random = new Random();
  
      static class FastScanner {
          BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
          StringTokenizer st = new StringTokenizer("");
  
          String next() {
              while (!st.hasMoreTokens())
                  try {
                      st = new StringTokenizer(br.readLine());
                  } catch (IOException e) {
                      e.printStackTrace();
                  }
              return st.nextToken();
          }
  
          int nextInt() {
              return Integer.parseInt(next());
          }
  
          int[] readArray(int n) {
              int[] a = new int[n];
              for (int i = 0; i < n; i++) a[i] = nextInt();
              return a;
          }
  
          long nextLong() {
              return Long.parseLong(next());
          }
      }
  
      static int[] reverse(int[] a) {
          int n = a.length;
          int[] res = new int[n];
          for (int i = 0; i < n; i++) res[i] = a[n - 1 - i];
          return res;
      }
  }