#include <bits/stdc++.h>
using namespace std;
template <typename T>
void vout(T x) {
  cout << x << endl;
  exit(0);
}
const int inf = 1e9 + 1;
const long long INF = 1e18 + 1e2;
const int mod = 1e9 + 7;
bool ok(int n) { return n % 10 != 3 && n % 3 != 0; }
void solve() {
  int k;
  cin >> k;
  int res = -1;
  for (int candidate = 1;; candidate++) {
    if (ok(candidate)) k--;
    if (k == 0) {
      cout << candidate << endl;
      return;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int q = 1;
  cin >> q;
  while (q--) {
    solve();
  }
  return 0;
}

### Prompt

Develop a solution in CPP to the problem described below:

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;
template <typename T>
void vout(T x) {
  cout << x << endl;
  exit(0);
}
const int inf = 1e9 + 1;
const long long INF = 1e18 + 1e2;
const int mod = 1e9 + 7;
bool ok(int n) { return n % 10 != 3 && n % 3 != 0; }
void solve() {
  int k;
  cin >> k;
  int res = -1;
  for (int candidate = 1;; candidate++) {
    if (ok(candidate)) k--;
    if (k == 0) {
      cout << candidate << endl;
      return;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int q = 1;
  cin >> q;
  while (q--) {
    solve();
  }
  return 0;
}

```