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 HelloWorld {
   
  	public static void main(String[] args) {
  		Scanner sc = new Scanner(System.in);
  		int t=sc.nextInt();
  		int x[]=new int[t];
  		for(int i=0;i<t;i++) {
  			x[i]=sc.nextInt();
  		}
  		for(int i=0;i<t;i++) {
  			int k=x[i]/18;
  			if(x[i]%18==0) {
  				k=k-1;
  			}
  			int l=x[i]%18;
  			int a=0,b=0;
  			for(int j=1;j<=30;j++) {
  				if(j%3==0 || j==13||j==23) {
  					continue;
  				}
  				a++;
  				if(j==29) {
  					b=j;
  					break;
  				}
  				else if(a==l) {
  					b=j;
  //					System.out.println(j);
  					break;
  				}
  			}
  			System.out.println((k*30)+b);
  		}
  	}
  	
  }