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 java.io.*;
   
  public class Main {
  	 static boolean Check = false;
  	 static String x = "";
  	 static PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
  	 public static void main(String[] args) throws IOException  {
  			FastReader sc = new FastReader();
  			int t = sc.nextInt();
  			ArrayList<Integer> x = new ArrayList<>();
  			for( int i= 1 ;i <= (int)10e5  ;i++ ) {
  				if( i%3 != 0 && (i%10) != 3) {
  					x.add(i);
  				}
  			}
  			while( t-- > 0) {
  				int k = sc.nextInt();
  				out.println( x.get(k-1));
  			}
  			out.flush();
  		 }
  		static int gcd(int a, int b) {
  		      if (b == 0)
  		        return a;
  		      return gcd(b, a % b);
  		    }
  	 
  	 	 static HashMap<Long,Long> primefactor( long n){
  	 		 HashMap<Long ,Long> hm = new HashMap<>();
  	 		 long temp = 0;
  	 		 while( n%2 == 0) {
  	 			 temp++;
  	 			 n/=2;
  	 		 }
  	 		 if( temp!= 0) {
  	 			 hm.put( 2L, temp);
  	 		 }
  	 		 long c = (long)Math.sqrt(n);
  	 		 for( long i = 3 ; i <= c ; i+=2) {
  	 			 temp = 0;
  	 			 while( n% i == 0) {
  	 				 temp++;
  	 				 n/=i;
  	 			 }
  	 			 if( temp!= 0) {
  	 				 hm.put( i, temp);
  	 			 }
  	 		 }
  	 		 if( n!= 1) {
  	 			 hm.put( n , 1L);
  	 		 }
  	 		 return hm;
  	 		// this is the link where i found this method
  	 		 // https://www.geeksforgeeks.org/print-all-prime-factors-of-a-given-number/
  	 	 }
  	 
  		 static class FastReader {
  		        BufferedReader br;
  		        StringTokenizer st;
  		 
  		        public FastReader()
  		        {
  		            br = new BufferedReader(
  		                new InputStreamReader(System.in));
  		        }
  		        
  		        String next()
  		        {
  		            while (st == null || !st.hasMoreElements()) {
  		                try {
  		                    st = new StringTokenizer(br.readLine());
  		                }
  		                catch (IOException e) {
  		                    e.printStackTrace();
  		                }
  		            }
  		            return st.nextToken();
  		        }
  		 
  		        int nextInt() { return Integer.parseInt(next()); }
  		 
  		        long nextLong() { return Long.parseLong(next()); }
  		 
  		        double nextDouble()
  		        {
  		            return Double.parseDouble(next());
  		        }
  		 
  		        String nextLine()
  		        {
  		            String str = "";
  		            try {
  		                str = br.readLine();
  		            }
  		            catch (IOException e) {
  		                e.printStackTrace();
  		            }
  		            return str;
  		        }
  		    }
  		
  }