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 sys
  from math import *
  import builtins
  
  # # For getting input from input.txt file
  # sys.stdin = open('input.txt', 'r')
  #
  # # Printing the Output to output.txt file
  # sys.stdout = open('output.txt', 'w')
  
  # input = sys.stdin.readline
  
  
  def print(x, end='\n'):
      sys.stdout.write(str(x) + end)
  
  
  # IO helpers
  def get_int():
      return int(input())
  
  
  def get_list_ints():
      return list(map(int, input().split()))
  
  
  def get_char_list():
      s = input()
      return list(s[:len(s) - 1])
  
  
  def get_tuple_ints():
      return tuple(map(int, input().split()))
  
  
  def print_iterable(p):
      print(" ".join(map(str, p)))
  
  
  def binary_search(arr, x):
      low = 0
      high = len(arr) - 1
      mid = 0
      while low <= high:
          mid = (high + low) // 2
          if arr[mid] < x:
              low = mid + 1
          elif arr[mid] > x:
              high = mid - 1
          else:
              return mid
      return high
  
  
  def main():
      t = get_int()
      for q in range(t):
          n = get_int()
          c = n // 10
          if n % 10 == 9:
              c += 1
          print(c)
      pass
  
  
  if __name__ == '__main__':
      main()
  