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;
  int main() {
    int t;
    cin >> t;
    while (t) {
      int n;
      cin >> n;
      int a = 30 * (n / 18);
      int b = n % 18;
      if (b == 0) a -= 1;
      if (b == 1) a += 1;
      if (b == 2) a += 2;
      if (b == 3) a += 4;
      if (b == 4) a += 5;
      if (b == 5) a += 7;
      if (b == 6) a += 8;
      if (b == 7) a += 10;
      if (b == 8) a += 11;
      if (b == 9) a += 14;
      if (b == 10) a += 16;
      if (b == 11) a += 17;
      if (b == 12) a += 19;
      if (b == 13) a += 20;
      if (b == 14) a += 22;
      if (b == 15) a += 25;
      if (b == 16) a += 26;
      if (b == 17) a += 28;
      cout << a << "\n";
      t--;
    }
  }
  