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.Scanner;
  
  public class Main {
      public static void main(String[] args) {
          Scanner cin = new Scanner(System.in);
          int a[] = new int[1005];
          a[1] = 1;
          for (int i = 2; i <= 1000; i++) {
              int x = a[i - 1] + 1;
              while (!judge(x)) {
                  x++;
              }
              a[i] = x;
          }
  
          int n = cin.nextInt();
          for (int i = 1; i <= n; i++) {
              int x = cin.nextInt();
              System.out.println(a[x]);
          }
      }
  
      //与3有关=false，与3无关=true
      public static boolean judge(int x) {
          //被3整除不行
          if (x % 3 == 0) {
              return false;
          }
          //有3不行
          if (x % 10 == 3) {
              return false;
          }
          return true;
      }
  }
  
  