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 2020 minutes of his time.
Chef has NN hours of free time. What is the maximum number of complete chess games he can play in that time?
Chess Time solution codechef
 The first line of input will contain a single integer TT, denoting the number of test cases.
 Each test case consists of a single line containing a single integer, NN.

There are only 22 type of denominations in Chefland:
 Coins worth 11 rupee each
 Notes worth 1010 rupees each
Chef wants to pay his friend exactly XX rupees. What is the minimum number of coins Chef needs to pay exactly XX rupees?
Output Format
For each test case, output on a new line the maximum number of complete chess games Chef can play in NN hours.
Constraints
 1≤T≤101≤T≤10
 1≤N≤101≤N≤10
Chess Time solution codechef
4
1
10
7
3
Chess Time solution codechef
3
30
21
9
Explanation
Test case 11: If every game Chef plays takes 2020 minutes, he can play 33 games in one hour.
Test case 22: If every game Chef plays takes 2020 minutes, he can play 3030 games in 1010 hours.
Test case 33: If every game Chef plays takes 2020 minutes, he can play 2121 games in 77 hours.
Test case 44: If every game Chef plays takes 2020 minutes, he can play 99 games in 33 hours.