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 Disliikes {
      public static void main(String[] args) {
          Scanner sc=new Scanner(System.in);
  
          int t=sc.nextInt();
  //
  //        int[] a=new int[1001];
  //
  //
  //        int k=0;
  //
  //        for(int i=1;i<=15000;i++)
  //        {
  //            if(k>=1000)
  //            {
  //                break;
  //            }
  //            if(i%3!=0&&i%10!=3)
  //            {
  //                a[k++]=i;
  //            }
  //        }
  
          while (t-->0)
          {
              int n=sc.nextInt();
  
              int k=0;
  
              for(int i=1;i<=15000;i++)
              {
                  if(k==n)
                  {
                      System.out.println(i-1);
                      break;
                  }
                  if(i%3!=0&&i%10!=3)
                  {
                      k++;
                  }
              }
             // System.out.println(a[n-1]);
          }
      }
  }
  