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
  import math
  from collections import deque,Counter
  #sys.setrecursionlimit(10**7)
  int1=lambda x: int(x)-1
  
  inp=lambda :int(input())
  mi=lambda :map(int,input().split())
  li=lambda :list(mi())
  mi1=lambda :map(int1,input().split())
  li1=lambda :list(mi1())
  mis=lambda :map(str,input().split())
  lis=lambda :list(mis())
  pr=print
  
  from collections import defaultdict
  """
  #初期値 0
  d=defaultdict(int)
  
  #初期値 1
  d=defaultdict(lambda:1)
  """
  
  mod=10**9+7
  Mod=998244353
  INF=10**18
  ans=0
  
  t=int(input())
  for _ in range(t):
    n=inp()
    print((n+1)//10)