Chef bought N items from a shop. Although it is hard to carry all these items in hand, so Chef has to buy some polybags to store these items.

1 polybag can contain at most 10 items. What is the minimum number of polybags needed by Chef?

------ Input Format ------ 

- The first line will contain an integer T - number of test cases. Then the test cases follow.
- The first and only line of each test case contains an integer N - the number of items bought by Chef.

------ Output Format ------ 

For each test case, output the minimum number of polybags required.

------ Constraints ------ 

$1 ≤ T ≤ 1000$
$1 ≤ N ≤ 1000$

----- Sample Input 1 ------ 
3
20
24
99

----- Sample Output 1 ------ 
2
3
10

----- explanation 1 ------ 
Test case-1:  Chef will require $2$ polybags. Chef can fit $10$ items in the first and second polybag each.

Test case-2:  Chef will require $3$ polybags. Chef can fit $10$ items in the first and second polybag each and fit the remaining $4$ items in the third polybag.

Source: codechef | Difficulty: EASY
Tags: Mathematics


Solutions:
import math
t = int(input())
for i in range(t):
	n = int(input())
	print(math.ceil(n / 10))


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


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


import math
n = int(input())
for i in range(n):
	num = int(input())
	r = math.ceil(num / 10)
	print(int(r))


for _ in range(int(input())):
	x = int(input())
	a = x % 10
	if a == 0:
		print(x // 10)
	else:
		print(x // 10 + 1)


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


n = int(input())
for i in range(0, n):
	N = int(input())
	if N <= 10:
		sum = 1
		print(sum)
	else:
		ans = N % 10
		ans1 = int(N / 10)
		if ans == 0:
			print(ans1)
		else:
			final = ans1 + 1
			print(final)


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


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


t = int(input())
for i in range(t):
	N = int(input())
	a = N // 10
	b = N % 10
	if b != 0:
		print(a + 1)
	else:
		print(a)


from math import ceil
for _ in range(int(input())):
	items = int(input())
	bags = ceil(items / 10)
	print(bags)


import math
for _ in range(int(input())):
	n = int(input())
	res = math.ceil(n / 10)
	print(res)


T = int(input())
for z in range(T):
	H = input().split()
	N = int(H[0])
	x = N / 10
	y = int(x + 0.9)
	round(y)
	print(y)


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


n = int(input())
for i in range(0, n):
	c = 0
	b = 0
	a = int(input())
	while 1:
		b = b + 10
		c = c + 1
		if b >= a:
			break
	print(c)


import math
for _ in range(int(input())):
	x = int(input())
	print(math.ceil(x / 10))


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


import math

def cyclic(a):
	return math.ceil(a / 10)
t = int(input())
for i in range(t):
	a = int(input())
	v = cyclic(a)
	print(v)


import math
for i in range(int(input())):
	n = int(input())
	c = n // 10
	if c == n / 10:
		print(c)
	else:
		print(c + 1)


import math
for i in range(int(input())):
	a = int(input())
	b = math.ceil(a / 10)
	print(b)


import math
for _ in range(int(input())):
	n = int(input())
	if n % 10 == 0:
		print(n // 10)
	else:
		print(math.ceil(n / 10))


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


import math
t = int(input())
i = 1
while i <= t:
	x = int(input())
	i = i + 1
	a = x / 10
	b = math.ceil(a)
	print(b)