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.io.BufferedReader;
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.util.ArrayList;
  import java.util.Collections;
  import java.util.StringTokenizer;
  
  public class problemA {
  	
  	
  	public static void main(String[] args) {
  		FastScanner fs = new FastScanner();
  		ArrayList<String> al = new ArrayList<>();
  		for(int i=1;i<=2000;i++) {
  			String s = String.valueOf(i);
  			if(!s.endsWith("3")) {
  				al.add(s);
  			}
  		}
  		ArrayList<Integer> all = new ArrayList<>();
  		for(String s:al) {
  			all.add(Integer.parseInt(s));
  		}
  		ArrayList<Integer> alll = new ArrayList<>();
  		for(int i :all) {
  			if(i%3 != 0) {
  				alll.add(i);
  			}
  		}
  		
  		int t = fs.nextInt();
  		for (int tt = 0; tt < t; tt++) {
  			int n = fs.nextInt();
  			
  				System.out.println(alll.get(n-1));
  			
  		}
  	
  	}
  
  	static void sort(int[] a) {
  		ArrayList<Integer> l = new ArrayList<>();
  		for (int i : a)
  			l.add(i);
  		Collections.sort(l);
  		for (int i = 0; i < a.length; i++)
  			a[i] = l.get(i);
  	}
  
  	static class FastScanner {
  		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
  		StringTokenizer st = new StringTokenizer("");
  
  		String next() {
  			while (!st.hasMoreTokens())
  				try {
  					st = new StringTokenizer(br.readLine());
  				} catch (IOException e) {
  					e.printStackTrace();
  				}
  			return st.nextToken();
  		}
  
  		int nextInt() {
  			return Integer.parseInt(next());
  		}
  
  		int[] readArray(int n) {
  			int[] a = new int[n];
  			for (int i = 0; i < n; i++)
  				a[i] = nextInt();
  			return a;
  		}
  
  		long nextLong() {
  			return Long.parseLong(next());
  		}
  	}
  
  }
  