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.*;
  import static java.lang.Math.*;
  public class GFG {
   
      public static void main(String[] args)
      {
          Scanner input=new Scanner(System.in);
          ArrayList<Integer> girdiler=new ArrayList<>();
          int testCase=input.nextInt();
          for(int i=0;i<testCase;i++){
              girdiler.add(input.nextInt());
          }
          HashMap<Integer, Integer> map = new HashMap<>();
          ArrayList<Integer> outputs=new ArrayList<>();
          int t=1;
       for(int j=0;j<girdiler.size();j++){
               for(int k=1;k<=1666;k++){
                    if((k%3)!=0 && (k%10)!=3){
                       
                       map.put(t,k);
                      t++;
                   }
                   
               if(t==girdiler.get(j)+1){
                       break;
               }
               }
              System.out.println(map.get(girdiler.get(j)));
              map.clear();
              t=1;
                }
               
      }
  }