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: 
  import java.util.*;
  
  // Warning: Printing unwanted or ill-formatted data to output will cause the test cases to fail
  public class Solution {
  
    static boolean solved = false;
    static int[] dislike = new int[1000];
    static Scanner sc = new Scanner(System.in);
  
    public static void solve() {
      if (!solved) {
        int count = 0;
        int x = 1;
        while (count != 1000) {
          if (x % 3 == 0) {
            x++;
            continue;
          }
          if (x % 10 == 3) {
            x++;
            continue;
          }
          dislike[count++] = x;
          x++;
        }
        solved = true;
      }
      int q = sc.nextInt();
      System.out.println(dislike[q - 1]);
    }
  
    public static void main(String[] args) {
      int t = sc.nextInt();
      while (t-- != 0) {
        solve();
      }
    }
  }
  