description: 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
solution: #include <bits/stdc++.h>
  using namespace std;
  const int oo = 1e9;
  const int Mod = 1e9 + 7;
  const long long OO = 1e18;
  const int N = 1e5 + 5;
  void file() {
    if (fopen("trash.inp", "r"))
      freopen("trash.inp", "r", stdin), freopen("trash.out", "w", stdout);
  }
  void in() {
    int x;
    cin >> x;
    int dem = 0, cur = 1;
    while (dem < x) {
      if (cur % 3 == 0 || cur % 10 == 3)
        ;
      else
        dem++;
      cur++;
    }
    cout << cur - 1 << '\n';
  }
  void solve() {}
  int main() {
    file();
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int test;
    cin >> test;
    while (test--) {
      in();
      solve();
    }
  }
  