Zoj 2965 accurately say cocacola

A-accurately say & quot; cocacola & quot ;!


Description

In a party held by cocacola company, several students stand in a circle and play a game.

One of them is selected as the first, and shocould 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 shocould say 26. the third shoshould say "cocacola" because 27 contains the digit '7 '. the fourth one shoshould say "cocacola" 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 "cocacola" 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 abve. 27 is then the minimum number to make this situation happen.

Input

Standard input will contain multiple test cases. the first line of the input is a single integer T (1 <=t <= 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 <= P <= 99 ).

Output

Results shoshould be directed to standard output. the output of each test case shocould be a single integer in one line, which is the minimum possible number for the first of the P "cocacola" s stands.

Sample Input

2
2
3

Sample output

27
70

After a value is given for the question, calculate the number of Columns with the shortest 7 or divisible by 7.

Well, watch the table carefully and start with me.

 1 #include<iostream>   2 #include<string.h>   3 #include<stdio.h>   4 #include<ctype.h>   5 #include<algorithm>   6 #include<stack>   7 #include<queue>   8 #include<set>   9 #include<math.h>  10 #include<vector>  11 #include<map>  12 #include<deque>  13 #include<list>  14 using namespace std;15 int a[100];16 int main()17 {18     int i;19     a[1]=7;20     a[2]=27;21     for(i=3;i<=10;i++)22     a[i]=70;23     a[11]=270;24     for(i=12;i<=99;i++)25     a[i]=700;26     int test;27     scanf("%d",&test);28     while(test--)29     {30         int n;31         scanf("%d",&n);32         printf("%d\n",a[n]);33     }34     return 0;35 36 } 

View code