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: def main():
      alpha = 'abcdefghijklmnopqrstuvwxyz'
      ALPHA = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
      inf = 1e17
      mod = 10 ** 9 + 7
  
      # Max = 10 ** 1
      # primes = []
      # prime = [True for i in range(Max + 1)]
      # p = 2
      # while (p * p <= Max + 1):
      #
      #     # If prime[p] is not
      #     # changed, then it is a prime
      #     if (prime[p] == True):
      #
      #         # Update all multiples of p
      #         for i in range(p * p, Max + 1, p):
      #             prime[i] = False
      #     p += 1
      #
      # for p in range(2, Max + 1):
      #     if prime[p]:
      #         primes.append(p)
      #
      # print(primes)
  
      def factorial(n):
          f = 1
  
          for i in range(1, n + 1):
              f = (f * i) % mod  # Now f never can
          # exceed 10^9+7
  
          return f
  
      def ncr(n, r):
          # initialize numerator
          # and denominator
          num = den = 1
          for i in range(r):
              num = (num * (n - i)) % mod
              den = (den * (i + 1)) % mod
          return (num * pow(den,
                            mod - 2, mod)) % mod
  
      def solve(n):
  
          return (n+1)//10
  
  
  
  
  
  
  
  
  
          pass
  
      t = int(input())
      ans = []
      for _ in range(t):
          #s = input()[:-1]
          n = int(input())
          #h,w= map(int, input().split())
          #arr = list(input()[:-1])
          #a = [int(x) for x in input().split()]
          #b = [int(x) for x in input().split()]
          # a2 = [int(x) for x in input().split()]
          # grid = []
          # for i in range(n):
          #     grid.append(input()[:-1])
          #
          # rem = []
          # for i in range(n-1):
          #     rem.append(input()[:-1])
  
          #print(grid)
          #print(rem)
          #m = int(input())
          ans.append(solve(n))
  
      for answer in ans:
          print(answer)
  
  
  if __name__ == "__main__":
      import sys, threading
      import bisect
      import math
      import itertools
      from sys import stdout
  
      # Sorted Containers
      import heapq
      from queue import PriorityQueue
  
      # Tree Problems
      # sys.setrecursionlimit(2 ** 32 // 2 - 1)
      # threading.stack_size(1 << 27)
  
      # fast io
      input = sys.stdin.readline
  
      thread = threading.Thread(target=main)
      thread.start()
      thread.join()