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: from os import path
  from sys import stdin, stdout
  if path.exists('tc.txt'):
      stdin = open('tc.txt', 'r')
  def gmi(): return map(int, stdin.readline().strip().split())
  def gms(): return map(str, stdin.readline().strip().split())
  def gari(): return list(map(int, stdin.readline().strip().split()))
  def gart(): return tuple(map(int, stdin.readline().strip().split()))
  def gars(): return list(map(str, stdin.readline().strip().split()))
  def gs(): return stdin.readline().strip()
  def gls(): return list(stdin.readline().strip())
  def gi(): return int(stdin.readline())
  
  for i in range(gi()):
      n=gi()
      x=n//10
      if n%10==9:
          print(x+1)
      else:
          print(x)
          
          
  
  
  
  
  # for _ in range(int(input())):
  #     n,m=gmi()
  #     v=[]
  #     p=[]
  #     for i in range(n):
  #         x=gari()
  #         v.append(x[0])
  #         p.append(x[1])
  #         r=[]
  #     v,p=zip(*sorted(zip(v,p)))
  #     for j in range(n):
  #         if p[j]<=2*m:
  #             r.append(v[j]/p[j])
      
  
  
  # x = math.floor(math.log(b)/math.log(2))
  # y = math.floor(math.log(a)/math.log(5))
  