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 A9 {
      public static void main(String[] args)
      {
          Scanner sc = new Scanner(System.in);
          int [] array= new int[2005];
          int num = 0;
          for(int i=1;i<=2000;i++)
          {
              int count=i;
              if(count % 3 == 0) continue;
              int p = count%10;
              if(p == 3) {
                      continue;
              }
               array[++ num] = i;
          }
  
          int size = sc.nextInt();
          while(size > 0)
          {
              int k;
              k = sc.nextInt();
              int ans = array[k];
              System.out.println(ans);
              size--;
          }
  
      }
  }
  