题目链接：Problem - A - Codeforces

Polycarp doesn't like integers that are divisible by 33 or end with the digit 33 in their decimal representation. Integers that meet both conditions are disliked by Polycarp, too.

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

Input

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

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

Output

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

Example

input

Copy

10
1
2
3
4
5
6
7
8
9
1000

output

Copy

1
2
4
5
7
8
10
11
14
1666

题意：1-1666的序列除去3的倍数和个位为3的数后输出第k个

#include<bits/stdc++.h>
using namespace std;

int arr[2000];

int main(){
	int t;
	int ans= 1;
	for(int i = 1; i<= 1666; i++){
		if(i % 3 != 0 && i % 10 != 3){
			arr[ans++] = i;
		}
	}
	int n;
	cin >> t;
	while(t--){
		cin >> n;
		cout << arr[n] << endl;
	}
	return 0;
}