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.*;
  
  public class Main {
  
      static void solve() {
          Scanner scan = new Scanner(System.in);
          int[] arr = new int[1001];
          int curr = 2;
          arr[1] = 1;
          int j = 2;
          while(j < arr.length) {
              if(curr % 3 == 0 || curr % 10 == 3) {
                  curr++;
                  continue;
              }
              arr[j++] = curr++;
          }
          int t = scan.nextInt();
          for (int i = 0; i < t; i++) {
              int n = scan.nextInt();
  //            int[] arr = new int[n];
  //            for (int j = 0; j < n; j++) {
  //                arr[j] = scan.nextInt();
  //            }
              solveCase(n, arr);
          }
      }
  
      static void solveCase(int n, int[] arr) {
          System.out.println(arr[n]);
      }
  
      public static void main(String[] args) {
           solve();
  
      }
  
      static class Pair {
          int row;
          int col;
  
          public Pair(int row, int col) {
              this.row = row;
              this.col = col;
          }
  
          @Override
          public boolean equals(Object o) {
              if (this == o) return true;
              if (o == null || getClass() != o.getClass()) return false;
              Pair pair = (Pair) o;
              return row == pair.row && col == pair.col;
          }
  
          @Override
          public int hashCode() {
              return Objects.hash(row, col);
          }
      }
  }
  