#描述#
In a party held by Coca-Cola company, several students stand in a circle and play a game.

One of them is selected as the first, and should say the number 1. Then they continue to count number from 1 one by one (clockwise). The game is interesting in that, once someone counts a number which is a multiple of 7 (e.g. 7, 14, 28, ...) or contains the digit '7' (e.g. 7, 17, 27, ...), he shall say "CocaCola" instead of the number itself.

For example, 4 students play this game. At some time, the first one says 25, then the second should say 26. The third should say "Coca-Cola" because 27 contains the digit '7'. The fourth one should say "Coca-Cola" too, because 28 is a multiple of 7. Then the first one says 29, and the game goes on. When someone makes a mistake, the game ends.

During a game, you may hear a consecutive of p "Coca-Cola"s. So what is the minimum number that can make this situation happen?

For example p = 2, that means there are a consecutive of 2 "CocaCola"s. This situation happens in 27-28 as stated above. 27 is then the minimum number to make this situation happen.

#格式#
##输入格式##
Standard input will contain multiple test cases. The first line of the input is a single integer T (1 &lt= T &lt= 100) which is the number of test cases. And it will be followed by T consecutive test cases.

There is only one line for each case. The line contains only one integer p (1 &lt= p &lt= 99).

##输出格式##
Results should be directed to standard output. The output of each test case should be a single integer in one line, which is the minimum possible number for the first of the p "CocaCola"s stands for.

#样例1#
##样例输入1##

2
2
3

##样例输出1##

27
70

#限制#
1000ms
32768KB

#提示#

#来源#
2008 Zhejiang Provincial Collegiate Programming Contest