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 \le x \le n$ and $x$ is interesting.


-----Input-----

The first line contains one integer $t$ ($1 \le t \le 1000$)  — number of test cases.

Then $t$ lines follow, the $i$-th line contains one integer $n$ ($1 \le n \le 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.


-----Examples-----

Input
5
1
9
10
34
880055535
Output
0
1
1
3
88005553


-----Note-----

The first interesting number is equal to $9$.

Difficulty: EASY

Solutions:
t = int(input())
while t:
	n = int(input())
	print(int((n + 1) // 10))
	t -= 1


t = int(input())
for i in range(t):
	n = int(input())
	x = n // 10
	if n % 10 == 9:
		x += 1
	print(x)


def digitSum(n):
	if n < 9:
		return 0
	elif n == 9:
		return 1
	else:
		return n // 10 + 1 if str(n)[-1] == '9' else n // 10
n = int(input())
for i in range(n):
	k = int(input())
	print(digitSum(k))


import sys
input = sys.stdin.readline

def S():
	return input()

def I():
	return int(S())

def M():
	return map(int, S().split())

def L():
	return list(M())
t = int(input())
for i in range(t):
	n = I()
	k = n // 10
	s = str(n)
	if s[-1] == '9':
		k += 1
	print(k)


t = int(input())
for _ in range(t):
	print((int(input()) + 1) // 10)


import atexit, io, sys, collections, math, heapq, fractions, copy, os, functools
import sys
import random
import collections
from io import BytesIO, IOBase
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
9
19
29
150
15
293439

def slow(n):
	c = 0
	for i in range(1, n + 1):
		if sum(list(map(int, str(n)))) > sum(list(map(int, str(n + 1)))):
			c += 1
	return c

def f(n):
	return n // 10 + (1 if n % 10 == 9 else 0)
for u in range(int(input())):
	n = int(input())
	print(f(n))


for _ in range(int(input())):
	n = int(input())
	ans = n // 10
	if n % 10 == 9:
		ans += 1
	print(ans)


import os, sys, math
from io import BytesIO, IOBase
ip = lambda : input()
it = lambda : int(input())
ma = lambda : map(int, input().split(' '))
li = lambda : list(map(int, input().split(' ')))
mod = 10 ** 9 + 7

def main():
	for _ in range(int(input())):
		n = it()
		ans = n // 10
		if n % 10 == 9:
			ans += 1
		print(ans)
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
main()


for _ in range(int(input())):
	x = int(input())
	l = range(9, x + 1, 10)
	if x < 9:
		print('0')
	else:
		print(len(l))


n = int(input())
for _ in range(n):
	num = int(input())
	d = num // 10
	r = num % 10
	if r == 9:
		print(d + 1)
	else:
		print(d)


for i in range(int(input())):
	v = int(input())
	ans = (v + 1) // 10
	print(ans)


t = int(input())
for _ in range(t):
	n = int(input())
	s = n // 10
	if n % 10 == 9:
		print(s + 1)
	else:
		print(s)


def solve2(num):
	if num < 9:
		return 0
	elif num == 9:
		return 1
	return (num + 1) // 10

def digits_sum():
	t = int(input())
	for i in range(t):
		num = int(input())
		print(solve2(num))
digits_sum()


for _ in range(int(input())):
	n = int(input())
	print(0 if n < 9 else (n + 1) // 10)


import heapq
import sys
from math import *
import threading
from heapq import *
from itertools import count
from pprint import pprint
from collections import defaultdict
from heapq import heapify, heappop, heappush
mod = 10 ** 9 + 7
inf = 10 ** 15
decision = ['NO', 'YES']
yes = 'YES'
no = 'NO'
import os
from io import BytesIO, IOBase
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')

class Factorial:

	def __init__(self, MOD):
		self.MOD = MOD
		self.factorials = [1, 1]
		self.invModulos = [0, 1]
		self.invFactorial_ = [1, 1]

	def calc(self, n):
		if n <= -1:
			print('Invalid argument to calculate n!')
			print('n must be non-negative value. But the argument was ' + str(n))
			exit()
		if n < len(self.factorials):
			return self.factorials[n]
		nextArr = [0] * (n + 1 - len(self.factorials))
		initialI = len(self.factorials)
		prev = self.factorials[-1]
		m = self.MOD
		for i in range(initialI, n + 1):
			prev = nextArr[i - initialI] = prev * i % m
		self.factorials += nextArr
		return self.factorials[n]

	def inv(self, n):
		if n <= -1:
			print('Invalid argument to calculate n^(-1)')
			print('n must be non-negative value. But the argument was ' + str(n))
			exit()
		p = self.MOD
		pi = n % p
		if pi < len(self.invModulos):
			return self.invModulos[pi]
		nextArr = [0] * (n + 1 - len(self.invModulos))
		initialI = len(self.invModulos)
		for i in range(initialI, min(p, n + 1)):
			next = -self.invModulos[p % i] * (p // i) % p
			self.invModulos.append(next)
		return self.invModulos[pi]

	def invFactorial(self, n):
		if n <= -1:
			print('Invalid argument to calculate (n^(-1))!')
			print('n must be non-negative value. But the argument was ' + str(n))
			exit()
		if n < len(self.invFactorial_):
			return self.invFactorial_[n]
		self.inv(n)
		nextArr = [0] * (n + 1 - len(self.invFactorial_))
		initialI = len(self.invFactorial_)
		prev = self.invFactorial_[-1]
		p = self.MOD
		for i in range(initialI, n + 1):
			prev = nextArr[i - initialI] = prev * self.invModulos[i % p] % p
		self.invFactorial_ += nextArr
		return self.invFactorial_[n]

class Combination:

	def __init__(self, MOD):
		self.MOD = MOD
		self.factorial = Factorial(MOD)

	def ncr(self, n, k):
		if k < 0 or n < k:
			return 0
		k = min(k, n - k)
		f = self.factorial
		return f.calc(n) * f.invFactorial(max(n - k, k)) * f.invFactorial(min(k, n - k)) % self.MOD

	def npr(self, n, k):
		if k < 0 or n < k:
			return 0
		f = self.factorial
		return f.calc(n) * f.invFactorial(n - k) % self.MOD

def lower_bound(li, num):
	answer = len(li)
	start = 0
	end = len(li) - 1
	while start <= end:
		middle = (end + start) // 2
		if li[middle] >= num:
			answer = middle
			end = middle - 1
		else:
			start = middle + 1
	return answer

def upper_bound(li, num):
	answer = len(li)
	start = 0
	end = len(li) - 1
	while start <= end:
		middle = (end + start) // 2
		if li[middle] <= num:
			start = middle + 1
		else:
			answer = middle
			end = middle - 1
	return answer

def abs(x):
	return x if x >= 0 else -x

def binary_search(li, val):
	ans = -1
	lb = 0
	ub = len(li) - 1
	while lb <= ub:
		mid = (lb + ub) // 2
		if li[mid] > val:
			ub = mid - 1
		elif val > li[mid]:
			lb = mid + 1
		else:
			ans = mid
			break
	return ans

def kadane(x):
	sum_so_far = 0
	current_sum = 0
	for i in x:
		current_sum += i
		if current_sum < 0:
			current_sum = 0
		else:
			sum_so_far = max(sum_so_far, current_sum)
	return sum_so_far

def pref(li):
	pref_sum = [0]
	for i in li:
		pref_sum.append(pref_sum[-1] + i)
	return pref_sum

def SieveOfEratosthenes(n):
	prime = [{1, i} for i in range(n + 1)]
	p = 2
	while p <= n:
		for i in range(p * 2, n + 1, p):
			prime[i].add(p)
		p += 1
	return prime

def primefactors(n):
	factors = []
	while n % 2 == 0:
		factors.append(2)
		n //= 2
	for i in range(3, int(sqrt(n)) + 1, 2):
		while n % i == 0:
			factors.append(i)
			n //= i
	if n > 2:
		factors.append(n)
	return factors

def prod(li):
	ans = 1
	for i in li:
		ans *= i
	return ans

def sumk(a, b):
	print('called for', a, b)
	ans = a * (a + 1) // 2
	ans -= b * (b + 1) // 2
	return ans

def sumi(n):
	ans = 0
	if len(n) > 1:
		for x in n:
			ans += int(x)
		return ans
	else:
		return int(n)

def checkwin(x, a):
	if a[0][0] == a[1][1] == a[2][2] == x:
		return 1
	if a[0][2] == a[1][1] == a[2][0] == x:
		return 1
	if len(set(a[0])) == 1 and a[0][0] == x or (len(set(a[1])) == 1 and a[1][0] == x) or (len(set(a[2])) == 1 and a[2][0] == x):
		return 1
	if len(set(a[0][:])) == 1 and a[0][0] == x or (len(set(a[1][:])) == 1 and a[0][1] == x) or (len(set(a[2][:])) == 1 and a[0][0] == x):
		return 1
	return 0
inf = 10 ** 9 + 7

def main():
	karmanya = int(input())
	while karmanya != 0:
		karmanya -= 1
		n = int(input())
		ans = n // 10
		if n % 10 == 9:
			ans += 1
		print(ans)
main()


from os import path
from math import ceil
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())
tc = gi()
while tc:
	tc -= 1
	n = gi()
	print(n // 10 + (1 if str(n)[-1] == '9' else 0))


for i in range(int(input())):
	n = int(input())
	print((n + 1) // 10)


n = int(input())
for i in range(n):
	a = int(input())
	if str(a)[len(str(a)) - 1] == '9':
		print(int(a / 10) + 1)
	else:
		print(int(a / 10))


import sys

def solution(num: int):
	return (num + 1) // 10
if sys.argv[-1] == 't':
	for case in [[1, 0], [9, 1], [10, 1], [34, 1]]:
		print(case, solution(case[0]))
else:
	for _ in range(int(input())):
		n = int(input())
		print(solution(n))


t = int(input())
while t:
	t -= 1
	i = int(input())
	print(int((i + 1) / 10))


import sys
input = lambda : sys.stdin.readline().strip()
for _ in ' ' * int(input()):
	n = int(input())
	print((n + 1) // 10)


for _ in [0] * int(input()):
	j = int(input())
	ans = j // 10
	if j % 10 == 9:
		ans = ans + 1
	print(ans)


n = int(input())
for i in range(n):
	a = int(input())
	if a < 9:
		print(0)
	elif a == 9:
		print(1)
	elif a % 10 == 9:
		print(a // 10 + 1)
	else:
		print(a // 10)


t = int(input())
for test in range(t):
	n = int(input())
	if n % 10 == 9:
		print(1 + n // 10)
	else:
		print(n // 10)


def solver():
	n = int(input())
	print(int((n + 1) / 10))
t = int(input())
while t > 0:
	solver()
	t = t - 1


for _ in [0] * int(input()):
	print((int(input()) + 1) // 10)


tst = int(input())
for i in range(tst):
	n = int(input())
	answer = (n + 1) // 10
	print(answer)


import math
t = int(input())
while t > 0:
	n = int(input())
	print(int((n + 1) // 10))
	t -= 1


import sys
input = lambda : sys.stdin.readline().strip()
for i in range(int(input())):
	a = int(input())
	print((a + 1) // 10)


number_of_tests = int(input())
l_resu = []
for _ in range(number_of_tests):
	n = input()
	if len(n) > 1:
		count_interestings = int(n[:-1])
	else:
		count_interestings = 0
	last_digit = n[-1]
	if last_digit == '9':
		count_interestings += 1
	l_resu.append(count_interestings)
for resu in l_resu:
	print(resu)


for tc in range(int(input())):
	n = int(input())
	print((n + 1) // 10)


for _ in range(int(input())):
	n = int(input())
	q = n // 10
	rem = n % 10
	q += rem // 9
	print(q)


import sys
t = int(sys.stdin.readline())
for _ in range(t):
	n = int(sys.stdin.readline())
	ans = n // 10
	if n % 10 == 9:
		ans += 1
	print(ans)


t = int(input())
mas = []
for i in range(t):
	a = int(input())
	mas.append(a)
ans = []
for el in mas:
	ans.append((el + 1) // 10)
for i in ans:
	print(i)


from math import ceil, floor
result = []
t = int(input())
for i in range(t):
	n = int(input())
	if n % 10 == 9:
		sum = ceil(n / 10)
	else:
		sum = floor(n / 10)
	result.append(sum)
for i in result:
	print(i)


def get(n):
	x = int(n / 10)
	if n % 10 == 9:
		return x + 1
	else:
		return x
n = int(input())
for i in range(n):
	num = int(input())
	print(get(num))


t = int(input())
for _ in range(t):
	n = int(input())
	if n <= 8:
		print(0)
	elif n == 9:
		print(1)
	else:
		y = n // 10
		if (n + 1) % 10 == 0:
			print(y + 1)
		else:
			print(y)


def solve():
	n = int(input())
	return n // 10 if n % 10 not in [9] else n // 10 + 1
t = int(input())
ans = []
while t:
	ans.append(str(solve()))
	t -= 1
print('\n'.join(ans))


import sys
input = sys.stdin.readline

def I():
	return input().strip()

def II():
	return int(input().strip())

def LI():
	return [*map(int, input().strip().split())]
import copy, string, math, time, functools, random, fractions
from heapq import heappush, heappop, heapify
from bisect import bisect_left, bisect_right
from collections import deque, defaultdict, Counter, OrderedDict
from itertools import permutations, combinations, groupby
from operator import itemgetter
for _ in range(II()):
	n = II()
	x = n + 1
	f = 0
	if n % 10 == 9:
		f = 1
	m = str(n)
	if f == 1:
		print(n // 10 + 1)
	else:
		print(n // 10)


for tt in range(int(input())):
	print((int(input()) + 1) // 10)


import sys
import math
from math import *
import builtins
import collections
input = sys.stdin.readline

def print(x, end='\n'):
	sys.stdout.write(str(x) + end)

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 CountFrequency(arr):
	return collections.Counter(arr)

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 pow(a, n):
	if n == 0:
		return 1
	elif n % 2 == 0:
		return pow(a, n // 2) % const * (pow(a, n // 2) % const) % const
	else:
		return pow(a, n // 2) % const * (pow(a, n // 2) % const) * (a % const) % const

def main():
	t = get_int()
	for i in range(t):
		x = get_int()
		print((x + 1) // 10)
	pass
main()


for q in range(int(input())):
	n = int(input())
	k = (n - 9) // 10
	print(k + 1)


import sys, math, heapq, bisect
input = sys.stdin.readline
from collections import defaultdict, deque
T = int(input())
for _ in range(T):
	n = int(input())
	n = n + 1
	print(n // 10)


a = [0, 0, 1, 10, 100, 1000, 10000, 100000, 1000000, 10000000, 100000000, 1000000000]

def func():
	for _ in range(int(input())):
		n = input()
		res = 0
		if n[-1] == '9':
			res = 1
		while len(n) > 1:
			if n[0] != '0':
				res += a[len(n)] * int(n[0])
			n = n[1:]
		print(res)
func()


import os
import sys
from io import BytesIO, IOBase
from types import GeneratorType
from collections import defaultdict
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
t = int(input())
for _ in range(t):
	n = int(input())
	curr = n // 10
	if n % 10 == 9:
		curr += 1
	print(curr)


n = int(input())
for i in range(n):
	p = int(input())
	if p % 10 == 9:
		print(p // 10 + 1)
	else:
		print(p // 10)


x = int(input())
for i in range(x):
	y = int(input())
	print((y + 1) // 10)


import sys
input = sys.stdin.readline
t = int(input())
for _ in range(t):
	n = int(input())
	print((n + 1) // 10)


import sys
from math import *
import builtins

def print(x, end='\n'):
	sys.stdout.write(str(x) + end)

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
main()


t = int(input())
for i in range(t):
	n = int(input())
	res = 0
	if n < 9:
		res = 0
	elif str(n)[-1] == '9':
		res = str(n)[:-1]
		if len(res) == 0:
			res = 1
		else:
			res = int(res)
			res += 1
	else:
		res = str(n)[:-1]
	print(res)


def main():
	alpha = 'abcdefghijklmnopqrstuvwxyz'
	ALPHA = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
	inf = 1e+17
	mod = 10 ** 9 + 7

	def factorial(n):
		f = 1
		for i in range(1, n + 1):
			f = f * i % mod
		return f

	def ncr(n, r):
		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):
		n = int(input())
		ans.append(solve(n))
	for answer in ans:
		print(answer)
import sys, threading
import bisect
import math
import itertools
from sys import stdout
import heapq
from queue import PriorityQueue
input = sys.stdin.readline
thread = threading.Thread(target=main)
thread.start()
thread.join()


for _ in range(int(input())):
	n = int(input())
	ans = n // 10 + bool(n % 10 == 9)
	print(ans)


t = int(input())
li = []
for a in range(t):
	n = int(input())
	li.append(n)
for num in li:
	print((num + 1) // 10)


import sys
lis = []
for line in sys.stdin:
	lis.append(line.rstrip())
for num in lis[1:]:
	print(int((int(num) + 1) / 10))


t = int(input())
for i in range(0, t, 1):
	n = int(input())
	cont = int(n / 10)
	n = n % 10
	if n == 9:
		cont = cont + 1
	print(cont)


for t in range(int(input())):
	n = int(input())
	print((n + 1) // 10)


for _ in range(int(input())):
	x = int(input())
	x += 1
	s = str(x)
	z = len(s)
	y = s[:z - 1]
	if z > 1:
		print(y)
	else:
		print(0)


t = int(input())
for case in range(t):
	n = int(input())
	print(n // 10 + int(n % 10 >= 9))


T = int(input())
while T > 0:
	T -= 1
	n = int(input())
	print((n + 1) // 10)


def f(x):
	if x % 10 == 9:
		return x // 10 + 1
	return x // 10
t = int(input())
for _ in range(t):
	print(f(int(input())))


import math
for _ in range(int(input())):
	n = int(input())
	if n % 10 == 9:
		print(n // 10 + 1)
	else:
		print(n // 10)


for g in [*open(0)][1:]:
	print((int(g) + 1) // 10)


def solve(n):
	rem = n % 10
	a = n // 10
	if rem == 9:
		print(a + 1)
	else:
		print(a)
t = int(input())
for i in range(t):
	n = int(input())
	solve(n)


t = int(input())
for i in range(t):
	k = int(input())
	if k < 9:
		print(0)
	elif k == 9:
		print(1)
	elif k % 10 == 9:
		print(int(k / 10) + 1)
	else:
		print(int(k / 10))


for s in [*open(0)][1:]:
	print((int(s) + 1) // 10)


import sys
import math

def solve(s):
	ans = (s + 1) // 10
	return ans
t = int(input())
for i in range(t):
	s = int(input())
	print(solve(s))


T = int(input())
for i in range(T):
	n = int(input())
	result = 0
	if n % 10 == 9:
		result = n // 10 + 1
	else:
		result = n // 10
	print(result)


for i in range(int(input())):
	a = int(input())
	print(a // 10 + (a % 10 == 9))


for case in range(int(input())):
	number = int(input())
	print(int((number + 1) / 10))


def soluciona():
	print((int(input()) + 1) // 10)
	pass
for _ in range(int(input())):
	soluciona()


t = int(input())
for q in range(t):
	n = int(input())
	print(abs(n - 9) // 10 + int(n >= 9))


t = int(input())
while t:
	t -= 1
	n = int(input())
	if n % 10 == 9:
		print(int(n / 10) + 1)
	else:
		print(int(n / 10))


for _ in range(int(input())):
	n = int(input())
	print((n + 1) // 10)


from sys import stdin
input = stdin.readline
from math import gcd
for _ in range(int(input().strip())):
	n = int(input())
	print(n // 10 + n % 10 // 9)


qn = list()
ans = list()
n = int(input())
for i in range(n):
	k = int(input())
	qn.append(k)
for i in range(n):
	k = (qn[i] + 1) // 10
	ans.append(k)
for item in ans:
	print(item)


def solve():
	n = int(input())
	print(n // 10 + (n % 10 == 9))
t = int(input())
for _ in range(t):
	solve()


t = int(input())
for _ in range(t):
	n = int(input())
	n = str(n + 1)
	if len(n) == 1:
		n = 0
	else:
		n = n[:-1]
	print(n)


import sys

def get_string():
	return sys.stdin.readline().strip()

def get_array():
	return list(map(int, sys.stdin.readline().rstrip().split()))

def get_num():
	return int(sys.stdin.readline())
t = get_num()
for i in range(t):
	count = 0
	x = get_num()
	if x % 10 == 9:
		count += 1 + x // 10
	else:
		count += x // 10
	print(count)


for T in range(int(input())):
	print((int(input()) + 1) // 10)


t = int(input())
lst = []
for i in range(t):
	q = int(input())
	if str(q)[-1] == '9':
		y = (q + 1) // 10
		lst.append(y)
	else:
		y = q // 10
		lst.append(y)
for b in lst:
	print(b)


t = int(input())
for c in range(0, t):
	n = int(input())
	print((n + 1) // 10)


from math import floor
for s in [*open(0)][1:]:
	print(floor((int(s) + 1) / 10))


T = int(input())
while T:
	N = int(input())
	S = list(map(int, str(N)))
	if S[-1] == 9:
		print(N // 10 + 1)
	else:
		print(N // 10)
	T = T - 1


import math
length = int(input())
result = []
for i in range(length):
	num = int(input())
	if num == 1:
		result.append(0)
	elif num == 9:
		result.append(1)
	else:
		n = math.floor(num / 10)
		if num - n * 10 == 9:
			n += 1
		result.append(n)
for i in result:
	print(i)


def solve():
	return int((n + 1) // 10)
from sys import stdin
input = stdin.readline
t = int(input())
for i in range(t):
	n = int(input())
	print(solve())


import os
import sys
import math
from io import BytesIO, IOBase
import io
from fractions import Fraction
import collections
from itertools import permutations
from collections import defaultdict
from collections import deque
from collections import Counter
import threading
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')

class SegmentTree:

	def __init__(self, data, default=0, func=lambda a, b: max(a, b)):
		self._default = default
		self._func = func
		self._len = len(data)
		self._size = _size = 1 << (self._len - 1).bit_length()
		self.data = [default] * (2 * _size)
		self.data[_size:_size + self._len] = data
		for i in reversed(range(_size)):
			self.data[i] = func(self.data[i + i], self.data[i + i + 1])

	def __delitem__(self, idx):
		self[idx] = self._default

	def __getitem__(self, idx):
		return self.data[idx + self._size]

	def __setitem__(self, idx, value):
		idx += self._size
		self.data[idx] = value
		idx >>= 1
		while idx:
			self.data[idx] = self._func(self.data[2 * idx], self.data[2 * idx + 1])
			idx >>= 1

	def __len__(self):
		return self._len

	def query(self, start, stop):
		if start == stop:
			return self.__getitem__(start)
		stop += 1
		start += self._size
		stop += self._size
		res = self._default
		while start < stop:
			if start & 1:
				res = self._func(res, self.data[start])
				start += 1
			if stop & 1:
				stop -= 1
				res = self._func(res, self.data[stop])
			start >>= 1
			stop >>= 1
		return res

	def __repr__(self):
		return 'SegmentTree({0})'.format(self.data)

class SegmentTree1:

	def __init__(self, data, default=0, func=lambda a, b: a + b):
		self._default = default
		self._func = func
		self._len = len(data)
		self._size = _size = 1 << (self._len - 1).bit_length()
		self.data = [default] * (2 * _size)
		self.data[_size:_size + self._len] = data
		for i in reversed(range(_size)):
			self.data[i] = func(self.data[i + i], self.data[i + i + 1])

	def __delitem__(self, idx):
		self[idx] = self._default

	def __getitem__(self, idx):
		return self.data[idx + self._size]

	def __setitem__(self, idx, value):
		idx += self._size
		self.data[idx] = value
		idx >>= 1
		while idx:
			self.data[idx] = self._func(self.data[2 * idx], self.data[2 * idx + 1])
			idx >>= 1

	def __len__(self):
		return self._len

	def query(self, start, stop):
		if start == stop:
			return self.__getitem__(start)
		stop += 1
		start += self._size
		stop += self._size
		res = self._default
		while start < stop:
			if start & 1:
				res = self._func(res, self.data[start])
				start += 1
			if stop & 1:
				stop -= 1
				res = self._func(res, self.data[stop])
			start >>= 1
			stop >>= 1
		return res

	def __repr__(self):
		return 'SegmentTree({0})'.format(self.data)
MOD = 10 ** 9 + 7

class Factorial:

	def __init__(self, MOD):
		self.MOD = MOD
		self.factorials = [1, 1]
		self.invModulos = [0, 1]
		self.invFactorial_ = [1, 1]

	def calc(self, n):
		if n <= -1:
			print('Invalid argument to calculate n!')
			print('n must be non-negative value. But the argument was ' + str(n))
			exit()
		if n < len(self.factorials):
			return self.factorials[n]
		nextArr = [0] * (n + 1 - len(self.factorials))
		initialI = len(self.factorials)
		prev = self.factorials[-1]
		m = self.MOD
		for i in range(initialI, n + 1):
			prev = nextArr[i - initialI] = prev * i % m
		self.factorials += nextArr
		return self.factorials[n]

	def inv(self, n):
		if n <= -1:
			print('Invalid argument to calculate n^(-1)')
			print('n must be non-negative value. But the argument was ' + str(n))
			exit()
		p = self.MOD
		pi = n % p
		if pi < len(self.invModulos):
			return self.invModulos[pi]
		nextArr = [0] * (n + 1 - len(self.invModulos))
		initialI = len(self.invModulos)
		for i in range(initialI, min(p, n + 1)):
			next = -self.invModulos[p % i] * (p // i) % p
			self.invModulos.append(next)
		return self.invModulos[pi]

	def invFactorial(self, n):
		if n <= -1:
			print('Invalid argument to calculate (n^(-1))!')
			print('n must be non-negative value. But the argument was ' + str(n))
			exit()
		if n < len(self.invFactorial_):
			return self.invFactorial_[n]
		self.inv(n)
		nextArr = [0] * (n + 1 - len(self.invFactorial_))
		initialI = len(self.invFactorial_)
		prev = self.invFactorial_[-1]
		p = self.MOD
		for i in range(initialI, n + 1):
			prev = nextArr[i - initialI] = prev * self.invModulos[i % p] % p
		self.invFactorial_ += nextArr
		return self.invFactorial_[n]

class Combination:

	def __init__(self, MOD):
		self.MOD = MOD
		self.factorial = Factorial(MOD)

	def ncr(self, n, k):
		if k < 0 or n < k:
			return 0
		k = min(k, n - k)
		f = self.factorial
		return f.calc(n) * f.invFactorial(max(n - k, k)) * f.invFactorial(min(k, n - k)) % self.MOD
mod = 10 ** 9 + 7
omod = 998244353
prime = [True for i in range(10001)]
prime[0] = prime[1] = False

def SieveOfEratosthenes(n=10000):
	p = 2
	c = 0
	while p <= n:
		if prime[p] == True:
			c += 1
			for i in range(p, n + 1, p):
				prime[i] = False
		p += 1

class DSU:

	def __init__(self, R, C):
		self.par = range(R * C + 1)
		self.rnk = [0] * (R * C + 1)
		self.sz = [1] * (R * C + 1)

	def find(self, x):
		if self.par[x] != x:
			self.par[x] = self.find(self.par[x])
		return self.par[x]

	def union(self, x, y):
		(xr, yr) = (self.find(x), self.find(y))
		if xr == yr:
			return
		if self.rnk[xr] < self.rnk[yr]:
			(xr, yr) = (yr, xr)
		if self.rnk[xr] == self.rnk[yr]:
			self.rnk[xr] += 1
		self.par[yr] = xr
		self.sz[xr] += self.sz[yr]

	def size(self, x):
		return self.sz[self.find(x)]

	def top(self):
		return self.size(len(self.sz) - 1) - 1

class LazySegTree:

	def __init__(self, _op, _e, _mapping, _composition, _id, v):

		def set(p, x):
			assert 0 <= p < _n
			p += _size
			for i in range(_log, 0, -1):
				_push(p >> i)
			_d[p] = x
			for i in range(1, _log + 1):
				_update(p >> i)

		def get(p):
			assert 0 <= p < _n
			p += _size
			for i in range(_log, 0, -1):
				_push(p >> i)
			return _d[p]

		def prod(l, r):
			assert 0 <= l <= r <= _n
			if l == r:
				return _e
			l += _size
			r += _size
			for i in range(_log, 0, -1):
				if l >> i << i != l:
					_push(l >> i)
				if r >> i << i != r:
					_push(r >> i)
			sml = _e
			smr = _e
			while l < r:
				if l & 1:
					sml = _op(sml, _d[l])
					l += 1
				if r & 1:
					r -= 1
					smr = _op(_d[r], smr)
				l >>= 1
				r >>= 1
			return _op(sml, smr)

		def apply(l, r, f):
			assert 0 <= l <= r <= _n
			if l == r:
				return
			l += _size
			r += _size
			for i in range(_log, 0, -1):
				if l >> i << i != l:
					_push(l >> i)
				if r >> i << i != r:
					_push(r - 1 >> i)
			l2 = l
			r2 = r
			while l < r:
				if l & 1:
					_all_apply(l, f)
					l += 1
				if r & 1:
					r -= 1
					_all_apply(r, f)
				l >>= 1
				r >>= 1
			l = l2
			r = r2
			for i in range(1, _log + 1):
				if l >> i << i != l:
					_update(l >> i)
				if r >> i << i != r:
					_update(r - 1 >> i)

		def _update(k):
			_d[k] = _op(_d[2 * k], _d[2 * k + 1])

		def _all_apply(k, f):
			_d[k] = _mapping(f, _d[k])
			if k < _size:
				_lz[k] = _composition(f, _lz[k])

		def _push(k):
			_all_apply(2 * k, _lz[k])
			_all_apply(2 * k + 1, _lz[k])
			_lz[k] = _id
		_n = len(v)
		_log = _n.bit_length()
		_size = 1 << _log
		_d = [_e] * (2 * _size)
		_lz = [_id] * _size
		for i in range(_n):
			_d[_size + i] = v[i]
		for i in range(_size - 1, 0, -1):
			_update(i)
		self.set = set
		self.get = get
		self.prod = prod
		self.apply = apply
MIL = 1 << 20

def makeNode(total, count):
	return total * MIL + count

def getTotal(node):
	return math.floor(node / MIL)

def getCount(node):
	return node - getTotal(node) * MIL
nodeIdentity = makeNode(0.0, 0.0)

def nodeOp(node1, node2):
	return node1 + node2
	return makeNode(getTotal(node1) + getTotal(node2), getCount(node1) + getCount(node2))
identityMapping = -1

def mapping(tag, node):
	if tag == identityMapping:
		return node
	count = getCount(node)
	return makeNode(tag * count, count)

def composition(mapping1, mapping2):
	return mapping1 if mapping1 != identityMapping else mapping2

def memodict(f):

	class memodict(dict):

		def __missing__(self, key):
			ret = self[key] = f(key)
			return ret
	return memodict().__getitem__

def pollard_rho(n):
	if n & 1 == 0:
		return 2
	if n % 3 == 0:
		return 3
	s = (n - 1 & 1 - n).bit_length() - 1
	d = n >> s
	for a in [2, 325, 9375, 28178, 450775, 9780504, 1795265022]:
		p = pow(a, d, n)
		if p == 1 or p == n - 1 or a % n == 0:
			continue
		for _ in range(s):
			prev = p
			p = p * p % n
			if p == 1:
				return math.gcd(prev - 1, n)
			if p == n - 1:
				break
		else:
			for i in range(2, n):
				(x, y) = (i, (i * i + 1) % n)
				f = math.gcd(abs(x - y), n)
				while f == 1:
					(x, y) = ((x * x + 1) % n, (y * y + 1) % n)
					y = (y * y + 1) % n
					f = math.gcd(abs(x - y), n)
				if f != n:
					return f
	return n

@memodict
def prime_factors(n):
	if n <= 1:
		return Counter()
	f = pollard_rho(n)
	return Counter([n]) if f == n else prime_factors(f) + prime_factors(n // f)

def distinct_factors(n):
	factors = [1]
	for (p, exp) in prime_factors(n).items():
		factors += [p ** i * factor for factor in factors for i in range(1, exp + 1)]
	return factors

def all_factors(n):
	(small, large) = ([], [])
	for i in range(1, int(n ** 0.5) + 1, 2 if n & 1 else 1):
		if not n % i:
			small.append(i)
			large.append(n // i)
	if small[-1] == large[-1]:
		large.pop()
	large.reverse()
	small.extend(large)
	return small

def binarySearch(arr, n, i, key):
	left = 0
	right = n - 1
	mid = 0
	res = n
	while left <= right:
		mid = (right + left) // 2
		if arr[mid][i] > key:
			res = mid
			right = mid - 1
		else:
			left = mid + 1
	return res

def binarySearch1(arr, n, i, key):
	left = 0
	right = n - 1
	mid = 0
	res = -1
	while left <= right:
		mid = (right + left) // 2
		if arr[mid][i] > key:
			right = mid - 1
		else:
			res = mid
			left = mid + 1
	return res
t = 1
t = int(input())
for _ in range(t):
	n = int(input())
	print((n + 1) // 10)


t = int(input())
for z in range(t):
	n = int(input())
	ans = 0
	if n < 10 and n == 9:
		print(1)
	else:
		if n % 10 == 9:
			ans = n // 10 + 1
		else:
			ans = n // 10
		print(ans)


import os
import sys
import math
from io import BytesIO, IOBase
from operator import itemgetter

def main():
	for _ in range(int(input())):
		n = int(input())
		print((n + 1) // 10)
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
if os.path.exists('input.txt'):
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('output.txt', 'w')
main()


t = int(input())
for r in range(t):
	n = int(input())
	if n != 9 and n % 10 != 9:
		print(n // 10)
	else:
		print(n // 10 + 1)


import math

def solve():
	n = int(input())
	return (n + 1) // 10
t = int(input())
while t > 0:
	t -= 1
	print(solve())


for i in range(int(input())):
	n = int(input())
	r = n // 10
	a = n % 10
	if a == 9:
		print(r + 1)
	else:
		print(r)


t = int(input())
results = []
for _ in range(t):
	n = int(input())
	result = 0
	if n < 9:
		result = 0
	elif n == 9:
		result = 1
	elif n % 10 == 9:
		result = int(n / 10) + 1
	else:
		result = int(n / 10)
	results.append(result)
for i in results:
	print(i)


import sys
import math
from collections import deque, Counter
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
mod = 10 ** 9 + 7
Mod = 998244353
INF = 10 ** 18
ans = 0
t = int(input())
for _ in range(t):
	n = inp()
	print((n + 1) // 10)


t = int(input())
for i in range(t):
	n = int(input())
	ans = (n + 1) // 10
	print(ans)


import math
t = int(input())
for i in range(t):
	n = int(input())
	a = n % 10
	while a != 9:
		if a == 0:
			n -= 1
			break
		a -= 1
		n -= 1
	print(n // 10 + 1)


def f():
	n = int(input())
	print((n + 1) // 10)
	return
t = int(input())
while t:
	f()
	t -= 1


t = int(input())
while t > 0:
	t = t - 1
	n = int(input())
	if n >= 1 and n < 9:
		print('0')
	elif n == 9:
		print('1')
	elif n % 10 == 9:
		print(n // 10 + 1)
	else:
		print(n // 10)


def s(v):
	sum = 0
	while v > 0:
		sum = sum + v % 10
		v = v // 10
	return sum
count = int(input(''))
list = [0] * count
for k in range(count):
	val = int(input(''))
	list[k] = (val + 1) // 10
for i in list:
	print(i)


j = int(input())
while j > 0:
	n = int(input())
	if n % 10 == 9:
		print(n // 10 + 1)
	else:
		print(n // 10)
	j = j - 1


for i in range(int(input())):
	n = int(input())
	if (n + 1) % 10 == 0:
		print(n // 10 + 1)
	else:
		print(n // 10)


n = int(input())
for p in range(n):
	k = int(input())
	print(k // 10 + int(k % 10 == 9) if 1 else 0)


from bisect import insort, bisect_right, bisect_left
from sys import stdout, stdin, setrecursionlimit
from heapq import heappush, heappop, heapify
from io import BytesIO, IOBase
from collections import *
from itertools import *
from random import *
from string import *
from queue import *
from math import *
from re import *
from os import *

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = read(self._fd, max(fstat(self._fd).st_size, 8192))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = read(self._fd, max(fstat(self._fd).st_size, 8192))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(stdin, stdout) = (IOWrapper(stdin), IOWrapper(stdout))
(graph, mod, szzz) = ({}, 10 ** 9 + 7, lambda : sorted(zzz()))

def getStr():
	return input()

def getInt():
	return int(input())

def listStr():
	return list(input())

def getStrs():
	return input().split()

def isInt(s):
	return '0' <= s[0] <= '9'

def input():
	return stdin.readline().strip()

def zzz():
	return [int(i) for i in input().split()]

def output(answer, end='\n'):
	stdout.write(str(answer) + end)

def lcd(xnum1, xnum2):
	return xnum1 * xnum2 // gcd(xnum1, xnum2)

def getPrimes(N=10 ** 5):
	SN = int(sqrt(N))
	sieve = [i for i in range(N + 1)]
	sieve[1] = 0
	for i in sieve:
		if i > SN:
			break
		if i == 0:
			continue
		for j in range(2 * i, N + 1, i):
			sieve[j] = 0
	prime = [i for i in range(N + 1) if sieve[i] != 0]
	return prime

def primeFactor(n, prime=getPrimes()):
	lst = []
	mx = int(sqrt(n)) + 1
	for i in prime:
		if i > mx:
			break
		while n % i == 0:
			lst.append(i)
			n //= i
	if n > 1:
		lst.append(n)
	return lst
dx = [-1, 1, 0, 0, 1, -1, 1, -1]
dy = [0, 0, 1, -1, 1, -1, -1, 1]
daysInMounth = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]
num = getInt()
for _ in range(num):
	arr = '0' + getStr()
	last = arr[-1]
	print(int(arr[:-1]) + 1 if last == '9' else int(arr[:-1]))


for u in range(int(input())):
	n = int(input())
	print((n + 1) // 10)


t = int(input())
for it in range(t):
	x = int(input())
	print((x + 1) // 10)


T = int(input())
for t in range(T):
	n = int(input())
	d = n // 10
	if n % 10 == 9:
		d += 1
	print(d)


t = int(input())
for caseNr in range(1, t + 1):
	n = int(input())
	count = n // 10
	if (n - 9) % 10 == 0:
		count += 1
	print(count)


for _ in range(int(input())):
	a = int(input())
	print((a + 1) // 10)


def find_interesting(n):
	return int((n + 1) / 10)
	sum = 0
	s = str(n)
	for x in s:
		sum += int(x)
	return s
t = int(input())
for i in range(0, t):
	n = int(input())
	p = find_interesting(n)
	print(p)


t = int(input())
while t > 0:
	n = int(input())
	print(n // 10 if (n + 1) % 10 else n // 10 + 1)
	t -= 1


def func():
	w = int(input())
	nmof10 = w - w % 10
	if w % 10 == 9:
		return ans.append(nmof10 // 10 + 1)
	return ans.append(nmof10 // 10)
n = int(input())
ans = []
for i in range(n):
	func()
for i in ans:
	print(i)


def solve():
	n = int(input())
	count = 0
	if n % 10 == 9:
		count = 1
	count += n // 10
	return count
for t in range(int(input())):
	print(solve())


def solve():
	n = int(input())
	print((n + 1) // 10)

def main():
	t = int(input())
	for _ in range(t):
		solve()
main()


for _ in range(int(input())):
	n = int(input())
	if n < 9:
		print(0)
	elif n == 9:
		print(1)
	else:
		s = str(n)
		if int(s[len(s) - 1]) == 9:
			s = s[0:len(s) - 1]
			print(int(s) + 1)
		else:
			s = s[0:len(s) - 1]
			print(int(s))


t = int(input())
for _ in range(t):
	n = int(input())
	while n % 10 != 9:
		n -= 1
	print((n - 9) // 10 + 1)


print('\n'.join(list(map(lambda _: str((int(input()) + 1) // 10), range(int(input()))))))


for _ in range(int(input())):
	n = int(input())
	c = 0
	if str(n)[-1] == '9':
		c = 1
	print(n // 10 + c)


for _ in range(0, int(input())):
	x = int(input()) + 1
	print(x // 10)


t = int(input())
while t > 0:
	t -= 1
	x = int(input()) + 1
	x = x // 10
	print(x)


t = int(input())
import functools

def s(s: int):
	s = str(s)
	return functools.reduce(lambda x, y: x + int(y), [y for y in s if y.isdigit()], 0)
for _ in range(t):
	n = int(input())
	if not n % 10 == 9:
		print(n // 10)
	else:
		print(n // 10 + 1)


def compute(num):
	last = num % 10
	total = int(num / 10)
	if last == 9:
		total += 1
	return total
n = int(input())
for i in range(0, n):
	x = int(input())
	print(compute(x))


import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
readint = lambda : int(sys.stdin.readline().rstrip('\r\n'))
readints = lambda : map(int, sys.stdin.readline().rstrip('\r\n').split())
readstr = lambda : sys.stdin.readline().rstrip('\r\n')
readstrs = lambda : map(str, sys.stdin.readline().rstrip('\r\n').split())
readarri = lambda : [int(_) for _ in sys.stdin.readline().rstrip('\r\n').split()]
readarrs = lambda : [str(_) for _ in sys.stdin.readline().rstrip('\r\n').split()]

def solve():
	print((int(input()) + 1) // 10)

def main():
	t = 1
	t = readint()
	for _ in range(t):
		solve()
main()


a = int(input())
b = 0
while b < a:
	c = int(input())
	if str(c)[-1] == '9':
		print(c // 10 + 1)
	else:
		print(c // 10)
	b += 1


n = int(input())
for nn in range(n):
	x = int(input())
	print(int((x + 1) / 10))


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)


from collections import defaultdict
import sys, io, os
INP = sys.stdin.readline
inp = lambda : [*map(int, INP().encode().split())]
sinp = lambda : [*map(str, INP().split())]
out = sys.stdout.write

def main():
	for _ in range(inp()[0]):
		n = inp()[0]
		print((n + 1) // 10)

def SumOfExpOfFactors(a):
	fac = 0
	lis = SortedList()
	if not a & 1:
		lis.add(2)
	while not a & 1:
		a >>= 1
		fac += 1
	for i in range(3, int(a ** 0.5) + 1, 2):
		if not a % i:
			lis.add(i)
		while not a % i:
			a //= i
			fac += 1
	if a != 1:
		lis.add(a)
		fac += 1
	return (fac, lis)
div = [0] * 1000001

def NumOfDivisors(n):
	for i in range(1, n + 1):
		for j in range(i, n + 1, i):
			div[j] += 1

def primes1(n):
	sieve = [True] * (n // 2)
	for i in range(3, int(n ** 0.5) + 1, 2):
		if sieve[i // 2]:
			sieve[i * i // 2::i] = [False] * ((n - i * i - 1) // (2 * i) + 1)
	return [2] + [2 * i + 1 for i in range(1, n // 2) if sieve[i]]

def GCD(a, b):
	if b == 0:
		return a
	else:
		return GCD(b, a % b)

class Graph:

	def __init__(self):
		self.Graph = defaultdict(list)

	def addEdge(self, u, v):
		self.Graph[u].append(v)
		self.Graph[v].append(u)

	def DFSUtil(self, v, visited):
		visited.add(v)
		for neighbour in self.Graph[v]:
			if neighbour not in visited:
				self.DFSUtil(neighbour, visited)

	def DFS(self, v):
		visited = set()
		self.DFSUtil(v, visited)

	def BFS(self, s):
		visited = set()
		queue = []
		queue.append(s)
		visited.add(s)
		while queue:
			s = queue.pop(0)
			for i in self.Graph[s]:
				if i not in visited:
					queue.append(i)
					visited.add(i)

class SortedList:

	def __init__(self, iterable=[], _load=200):
		values = sorted(iterable)
		self._len = _len = len(values)
		self._load = _load
		self._lists = _lists = [values[i:i + _load] for i in range(0, _len, _load)]
		self._list_lens = [len(_list) for _list in _lists]
		self._mins = [_list[0] for _list in _lists]
		self._fen_tree = []
		self._rebuild = True

	def _fen_build(self):
		self._fen_tree[:] = self._list_lens
		_fen_tree = self._fen_tree
		for i in range(len(_fen_tree)):
			if i | i + 1 < len(_fen_tree):
				_fen_tree[i | i + 1] += _fen_tree[i]
		self._rebuild = False

	def _fen_update(self, index, value):
		if not self._rebuild:
			_fen_tree = self._fen_tree
			while index < len(_fen_tree):
				_fen_tree[index] += value
				index |= index + 1

	def _fen_query(self, end):
		if self._rebuild:
			self._fen_build()
		_fen_tree = self._fen_tree
		x = 0
		while end:
			x += _fen_tree[end - 1]
			end &= end - 1
		return x

	def _fen_findkth(self, k):
		_list_lens = self._list_lens
		if k < _list_lens[0]:
			return (0, k)
		if k >= self._len - _list_lens[-1]:
			return (len(_list_lens) - 1, k + _list_lens[-1] - self._len)
		if self._rebuild:
			self._fen_build()
		_fen_tree = self._fen_tree
		idx = -1
		for d in reversed(range(len(_fen_tree).bit_length())):
			right_idx = idx + (1 << d)
			if right_idx < len(_fen_tree) and k >= _fen_tree[right_idx]:
				idx = right_idx
				k -= _fen_tree[idx]
		return (idx + 1, k)

	def _delete(self, pos, idx):
		_lists = self._lists
		_mins = self._mins
		_list_lens = self._list_lens
		self._len -= 1
		self._fen_update(pos, -1)
		del _lists[pos][idx]
		_list_lens[pos] -= 1
		if _list_lens[pos]:
			_mins[pos] = _lists[pos][0]
		else:
			del _lists[pos]
			del _list_lens[pos]
			del _mins[pos]
			self._rebuild = True

	def _loc_left(self, value):
		if not self._len:
			return (0, 0)
		_lists = self._lists
		_mins = self._mins
		(lo, pos) = (-1, len(_lists) - 1)
		while lo + 1 < pos:
			mi = lo + pos >> 1
			if value <= _mins[mi]:
				pos = mi
			else:
				lo = mi
		if pos and value <= _lists[pos - 1][-1]:
			pos -= 1
		_list = _lists[pos]
		(lo, idx) = (-1, len(_list))
		while lo + 1 < idx:
			mi = lo + idx >> 1
			if value <= _list[mi]:
				idx = mi
			else:
				lo = mi
		return (pos, idx)

	def _loc_right(self, value):
		if not self._len:
			return (0, 0)
		_lists = self._lists
		_mins = self._mins
		(pos, hi) = (0, len(_lists))
		while pos + 1 < hi:
			mi = pos + hi >> 1
			if value < _mins[mi]:
				hi = mi
			else:
				pos = mi
		_list = _lists[pos]
		(lo, idx) = (-1, len(_list))
		while lo + 1 < idx:
			mi = lo + idx >> 1
			if value < _list[mi]:
				idx = mi
			else:
				lo = mi
		return (pos, idx)

	def add(self, value):
		_load = self._load
		_lists = self._lists
		_mins = self._mins
		_list_lens = self._list_lens
		self._len += 1
		if _lists:
			(pos, idx) = self._loc_right(value)
			self._fen_update(pos, 1)
			_list = _lists[pos]
			_list.insert(idx, value)
			_list_lens[pos] += 1
			_mins[pos] = _list[0]
			if _load + _load < len(_list):
				_lists.insert(pos + 1, _list[_load:])
				_list_lens.insert(pos + 1, len(_list) - _load)
				_mins.insert(pos + 1, _list[_load])
				_list_lens[pos] = _load
				del _list[_load:]
				self._rebuild = True
		else:
			_lists.append([value])
			_mins.append(value)
			_list_lens.append(1)
			self._rebuild = True

	def discard(self, value):
		_lists = self._lists
		if _lists:
			(pos, idx) = self._loc_right(value)
			if idx and _lists[pos][idx - 1] == value:
				self._delete(pos, idx - 1)

	def remove(self, value):
		_len = self._len
		self.discard(value)
		if _len == self._len:
			raise ValueError('{0!r} not in list'.format(value))

	def pop(self, index=-1):
		(pos, idx) = self._fen_findkth(self._len + index if index < 0 else index)
		value = self._lists[pos][idx]
		self._delete(pos, idx)
		return value

	def bisect_left(self, value):
		(pos, idx) = self._loc_left(value)
		return self._fen_query(pos) + idx

	def bisect_right(self, value):
		(pos, idx) = self._loc_right(value)
		return self._fen_query(pos) + idx

	def count(self, value):
		return self.bisect_right(value) - self.bisect_left(value)

	def __len__(self):
		return self._len

	def __getitem__(self, index):
		(pos, idx) = self._fen_findkth(self._len + index if index < 0 else index)
		return self._lists[pos][idx]

	def __delitem__(self, index):
		(pos, idx) = self._fen_findkth(self._len + index if index < 0 else index)
		self._delete(pos, idx)

	def __contains__(self, value):
		_lists = self._lists
		if _lists:
			(pos, idx) = self._loc_left(value)
			return idx < len(_lists[pos]) and _lists[pos][idx] == value
		return False

	def __iter__(self):
		return (value for _list in self._lists for value in _list)

	def __reversed__(self):
		return (value for _list in reversed(self._lists) for value in reversed(_list))

	def __repr__(self):
		return 'SortedList({0})'.format(list(self))
main()


for _ in range(int(input())):
	n = int(input())
	s = '0' + str(n)
	lst = s[-1]
	ans = int(s[:-1])
	if lst == '9':
		ans += 1
	print(ans)


t = input()
l = []
for i in range(int(t)):
	n = input('\n')
	n = int(n)
	r = n % 10
	if r != 9:
		count = int(n / 10)
	else:
		count = int(n / 10) + 1
	l.append(count)
for i in range(len(l)):
	print(l[i])


from sys import stdin
_input = stdin.readline
(_range, _int) = (range, int)

def solution():
	for _ in _range(_int(_input())):
		n = _int(_input())
		ans = n // 10
		if n % 10 == 9:
			ans += 1
		print(ans)
solution()


for i in range(int(input())):
	num = int(input())
	if num < 9:
		print(0)
		continue
	if num % 10 == 9:
		print(num // 10 + 1)
		continue
	else:
		print(num // 10)


t = int(input())
mod = 10 ** 9 + 7
while t:
	t -= 1
	n = int(input())
	mod = n % 10
	div = int(n / 10)
	if mod == 9:
		print(div + 1)
	else:
		print(div)


t = int(input())
for _ in range(t):
	n = int(input())
	print(n // 10 + (n % 10 == 9))


t = int(input())
while t > 0:
	x = int(input())
	ans = x // 10
	if x % 10 == 9:
		ans += 1
	print(ans)
	t -= 1


t = int(input())
answer = []
for i in range(0, t):
	n = int(input())
	if n % 10 == 9:
		answer.append(int(n / 10 + 1))
	else:
		answer.append(int(n / 10))
for x in answer:
	print(x)


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)


t = int(input())
n = []
for _ in range(t):
	n.append(int(input()))
for number in n:
	counter = number // 100 * 10
	counter += number % 100 // 10
	if str(number)[-1] == '9':
		counter += 1
	print(counter)


from math import floor, gcd, sqrt, ceil

def main():
	for _ in range(int(input())):
		n = int(input())
		print(floor((n + 1) / 10))
main()


a = int(input())
for i in range(a):
	b = int(input())
	print((b + 1) // 10)


import time
from collections import deque

def inpt():
	return int(input())

def inpl():
	return list(map(int, input().split()))

def inpm():
	return map(int, input().split())

def solve():
	n = inpt()
	print((n + 1) // 10)

def main():
	m = 10 ** 9 + 7
	t = int(input())
	while t:
		t -= 1
		solve()
main()


number = int(input().strip())
for i in range(number):
	a = int(input().strip())
	if a % 10 == 9:
		print(int(a / 10) + 1)
	else:
		print(int(a / 10))


t = int(input())
num = 9
numbers = 0
for k in range(t):
	n = input()
	if len(n) == 1:
		if n == '9':
			print(1)
		else:
			print(0)
	elif n[-1] == '9':
		print(int(n[:-1]) + 1)
	else:
		print(int(n[:-1]))


t = int(input())
while t != 0:
	n = int(input())
	x = n % 10
	a = n // 10
	if x == 9:
		print(a + 1)
	else:
		print(a)
	t -= 1


t1 = int(input())
for _ in range(t1):
	n = int(input())
	n1 = str(n)
	if n1[-1] == '9':
		n += 1
	print(n // 10)


def main():
	for i in range(num()):
		solve()

def solve():
	n = num()
	print((n + 1) // 10)
import itertools
import bisect, math
import copy
import fractions

def s(e):
	return sum(e)

def l(e):
	return len(e)

def num():
	return int(input())

def array():
	return list(map(int, input().split()))

def pair():
	return map(int, input().split())

def p(x='', end='\n'):
	return print(x, end=end)

def sort(a):
	return sorted(a)

def fpair(x):
	return str(fractions.Fraction(x)).split('/')

def nined(s):
	print('{:.9f}'.format(s))

def parray(a):
	for i in a:
		p(i, end=' ')
	p()

def sumx(x):
	if x % 2 == 0:
		return (x + 1) * (x // 2)
	else:
		return (x + 1) * ((x - 1) // 2) + (x + 1) // 2
main()


def main():
	n = int(input())
	for i in range(n):
		num = int(input())
		if num < 9:
			print(0)
		else:
			print(int((num + 1) / 10))
main()


x = int(input())
l = []
for i in range(x):
	k = int(input())
	l.append(k)
for i in range(x):
	k = str(l[i])
	if int(k[-1]) != 9:
		print(int(k) // 10)
	else:
		print(int(k) // 10 + 1)


t = int(input())
for i in range(t):
	n = int(input())
	count = 0
	if n == 9:
		count = 1
	elif n % 10 == 9:
		count = n // 10 + 1
	else:
		count = n // 10
	print(count)


from itertools import count
import sys
import math
__ = int(sys.stdin.readline())
for _ in range(__):
	n = int(sys.stdin.readline())
	x = n // 10
	y = n % 10
	if y == 9:
		print(x + 1)
	else:
		print(x)


n = int(input())
for i in range(n):
	inp = int(input())
	ans = int(inp / 10)
	if inp % 10 == 9:
		ans += 1
	print(ans)


for iii in range(int(input())):
	n = int(input())
	n = n + 1
	n = n // 10
	print(n)


def check(n):
	print((n + 1) // 10)
cases = []
for _ in range(int(input())):
	cases.append(int(input()))
for n in cases:
	check(n)


t = int(input())
a = []
for i in range(t):
	a.append(int(input()))
for elem in a:
	z = int(elem) + 1
	y = int(z / 10)
	print(y)


numberCase = int(input())
resultList = []
for n in range(numberCase):
	number = input()
	if number[-1] == '9':
		number = int(number)
		interestingNumber = number // 10 + 1
	else:
		number = int(number)
		interestingNumber = number // 10
	resultList.append(interestingNumber)
for result in resultList:
	print(result)


import sys
import io, os
input = sys.stdin.buffer.readline
t = int(input())
for _ in range(t):
	n = int(input())
	if n < 9:
		print(0)
	else:
		s = str(n + 1)
		print(s[:-1])


T = int(input())
for _ in range(T):
	val = int(input())
	count = 0
	mod = val % 10
	if mod < 9:
		count += val // 10
	else:
		count = val // 10 + 1
	print(count)


k = int(input())
for i in range(k):
	t = int(input())
	print(int((t + 1) / 10))


n = int(input())
for j in range(n):
	a = int(input())
	c = []
	c.append((a + 1) // 10)
	print(*c)


def read_line():
	return [int(x) for x in input().split()]

def read_int():
	return int(input())

def solve():
	n = read_int()
	res = int(n // 10)
	if n % 10 == 9:
		res += 1
	print(res)
t = read_int()
while t > 0:
	solve()
	t -= 1


import math
for _ in range(int(input())):
	n = int(input())
	print(math.floor((n + 1) / 10))


from sys import stdin, stdout

def read():
	return stdin.readline().strip()

def read_int():
	return [int(i) for i in read().split()]

def write(s):
	stdout.write(s)
for _ in range(int(read())):
	n = int(read())
	print((n + 1) // 10)