Solve the programming task below in a Python markdown code block.
Chef has recently started playing chess, and wants to play as many games as possible. 

He calculated that playing one game of chess takes at least 20 minutes of his time.

Chef has N hours of free time. What is the maximum number of complete chess games he can play in that time?

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

- The first line of input will contain a single integer T, denoting the number of test cases.
- Each test case consists of a single line containing a single integer, N.

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

For each test case, output on a new line the maximum number of complete chess games Chef can play in N hours.

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

$1 ≤ T ≤ 10$
$1 ≤ N ≤ 10$

----- Sample Input 1 ------ 
4
1
10
7
3

----- Sample Output 1 ------ 
3
30
21
9

----- explanation 1 ------ 
Test case $1$: If every game Chef plays takes $20$ minutes, he can play $3$ games in one hour.

Test case $2$: If every game Chef plays takes $20$ minutes, he can play $30$ games in $10$ hours.

Test case $3$: If every game Chef plays takes $20$ minutes, he can play $21$ games in $7$ hours.

Test case $4$: If every game Chef plays takes $20$ minutes, he can play $9$ games in $3$ hours.