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 sys import stdin, stdout
  def arrin():
      return list(map(int, stdin.readline().split()))
  def num1in():
      return int(stdin.readline())
  def num2in():
      a, b = map(int, stdin.readline().split())
      return a, b
  def num3in():
      a, b, c = map(int, stdin.readline().split())
      return a, b, c
  def num4in():
      a, b, c, d = map(int, stdin.readline().split())
      return a, b, c, d
  def num5in():
      a, b, c, d, e = map(int, stdin.readline().split())
      return a, b, c, d, e
  t=num1in()
  for test in range(t):
      n=num1in()
      ans = (n+1)//10
      print(ans)
  
  