#include <bits/stdc++.h>
using namespace std;
const int INF_INT = 2147483647;
const long long INF_LL = 9223372036854775807LL;
int gcd(int a, int b) { return ((b == 0) ? a : gcd(b, a % b)); }
int lcm(int a, int b) { return a * b / gcd(a, b); }
void solve() {
  int n;
  cin >> n;
  long long tmp = 1;
  while (n) {
    if (tmp % 3 == 0 || tmp % 10 == 3) {
      tmp++;
      continue;
    }
    tmp++;
    n--;
  }
  cout << tmp - 1 << endl;
}
int main() {
  ios::sync_with_stdio();
  cin.tie();
  ;
  int t;
  cin >> t;
  while (t--) solve();
}

### Prompt

Your task is to create a Cpp solution to the following problem:

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

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
const int INF_INT = 2147483647;
const long long INF_LL = 9223372036854775807LL;
int gcd(int a, int b) { return ((b == 0) ? a : gcd(b, a % b)); }
int lcm(int a, int b) { return a * b / gcd(a, b); }
void solve() {
  int n;
  cin >> n;
  long long tmp = 1;
  while (n) {
    if (tmp % 3 == 0 || tmp % 10 == 3) {
      tmp++;
      continue;
    }
    tmp++;
    n--;
  }
  cout << tmp - 1 << endl;
}
int main() {
  ios::sync_with_stdio();
  cin.tie();
  ;
  int t;
  cin >> t;
  while (t--) solve();
}

```