human
PYTHON 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":
assistant
#Here is the Python program you requested.
 def Solution():
    tests = input()
    inp = []
    res = []
    result = []
    n = 1

    while tests:
        i = input()
        inp.append(i)
        tests -= 1

    while len(res) <= max(inp):
        if n % 3 == 0:
            n += 1
            continue
        elif str(n)[-1] == '3':
            n += 1
            continue
        else:
            res.append(n)

        n += 1

    for l in inp:
        result.append(res[l - 1])

    for j in result:
        print j

Solution()