human
PYTHON3 solution for "Polycarp doesn't like integers that are divisible by 3 or end with the digit 3 in their decimal representation. Integers that meet both conditions are disliked by Polycarp, too.

Polycarp starts to write out the positive (greater than 0) integers which he likes: 1, 2, 4, 5, 7, 8, 10, 11, 14, 16, .... Output the k-th element of this sequence (the elements are numbered from 1).

Input

The first line contains one integer t (1 ≤ t ≤ 100) — the number of test cases. Then t test cases follow.

Each test case consists of one line containing one integer k (1 ≤ k ≤ 1000).

Output

For each test case, output in a separate line one integer x — the k-th element of the sequence that was written out by Polycarp.

Example

Input

10
1
2
3
4
5
6
7
8
9
1000

Output

1
2
4
5
7
8
10
11
14
1666":



Write me a the Python code you requested?
assistant
#Here is the Python code you requested.
 def find(a):
    maxi=max(a)
    p=[0]*(maxi+1)
    j=1
    i=1
    while(i<maxi+1):
        if j%10==3 or j%3==0:
            j+=1
        else:
            p[i]=j
            i+=1
            j+=1
    return p
       
        


t=int(input())
a=[]
for i in range(t):
    a.append(int(input()))
p=find(a)
for i in a:
    print(p[i])