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 DislikeOfThrees_A1560 {
  	public static void main(String[] args) {
  		Scanner scanner = new Scanner(System.in);
  		long tests = scanner.nextInt();
  		scanner.nextLine();
  		for (int i = 0; i < tests; i = i + 1) {
  			int k = scanner.nextInt();
  			int x = (k-6)/6;
  			int findingsUntilX = 6+6*x;
  			int beginAt = 10+10*x;
  			if(k<=6) {
  				findingsUntilX = 0;
  				beginAt = 0;
  			}
  			int restFindingsToFind = k-findingsUntilX;
  			if (restFindingsToFind==0) {
  				beginAt = beginAt -10;
  				restFindingsToFind = 6;
  			}
  			for (int j=beginAt; j<=beginAt+10;j++) {
  				if(j%3!=0&&j%10!=3) {
  					restFindingsToFind = restFindingsToFind -1;
  					if (restFindingsToFind ==0){
  						System.out.println(j);
  					}
  				}
  			}
  			scanner.nextLine();
  		}
  		scanner.close();
  	}
  }
  