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 Codeforces {
      public static void main(String[] args) {
          Scanner sc = new Scanner(System.in);
          int cnt = sc.nextInt();
          int[] ar = new int[cnt];
          for (int i = 0; i < cnt; i++) {
              ar[i] = sc.nextInt();
          }
  
          int[] numbers = new int[2000];
          int cntNum = 0;
          for (int i = 1; i < 2001; i++) {
              boolean isLove;
              if (i < 10) {
                  isLove = i % 3 != 0;
              } else if (i < 100) {
                  int firstDig = i / 10;
                  int secondDig = i % 10;
                  isLove = (firstDig + secondDig) % 3 != 0 && secondDig != 3;
              } else {
                  int firstDig = i / 100;
                  int secondDig = i / 10 % 10;
                  int thirdDig = i % 10;
                  isLove = (firstDig + secondDig + thirdDig) % 3 != 0 && thirdDig != 3;
              }
              if (isLove) {
                  cntNum++;
                  numbers[cntNum] = i;
              }
          }
  
          int[] res = new int[cntNum];
          System.arraycopy(numbers, 1, res, 0, cntNum);
          for (int i = 0; i < cnt; i++) {
              System.out.println(res[ar[i] - 1]);
          }
      }
  }
  