## Algorithm

A. Dislike of Threes
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

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 k-th element of this sequence (the elements are numbered from 11).

Input

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

Each test case consists of one line containing one integer k (1k10001≤�≤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
Copy
10
1
2
3
4
5
6
7
8
9
1000

output
Copy
1
2
4
5
7
8
10
11
14
1666

## Code Examples

### #1 Code Example with C++ Programming

Code - C++ Programming

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

int main(){
int t;
cin>>t;
int n;
while(t--){
cin>>n;
int ans;
int i = 0, j = 1;
while(i != n){
if(j%3 != 0 && j % 10 != 3){
ans = j;
j++;
}
else{
j++;
continue;
}
i++;
}
cout<<ans<<endl;
}
}
Copy The Code &

Input

cmd
10
1
2
3
4
5
6
7
8
9
1000

Output

cmd
1
2
4
5
7
8
10
11
14
1666