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;
  template <class T>
  bool ckmin(T &a, const T &b) {
    return a > b ? a = b, 1 : 0;
  }
  template <class T>
  bool ckmax(T &a, const T &b) {
    return a < b ? a = b, 1 : 0;
  }
  void read(vector<long long int> &a, int n) {
    a.resize(n);
    for (int i = 0; i < n; i++) cin >> a[i];
  }
  bool fine = 1;
  vector<long long int> a, b;
  long long int n, m, k, x, y, p, q, u, v;
  long long int d;
  void solve() {
    cin >> n;
    int c = 0;
    for (int i = 1; i <= 2000; i++) {
      if (i % 3 == 0 || i % 10 == 3) continue;
      ++c;
      if (c == n) {
        cout << i << "\n";
        return;
      }
    }
  }
  int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    if (fine) {
      int t;
      cin >> t;
      while (t--) {
        solve();
      }
    } else
      solve();
    return 0;
  }
  