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 math as mt
  import sys, string
  from collections import Counter, defaultdict
  input = sys.stdin.readline
   
  MOD = 1000000007
  PI = 3.14159265358979323
   
  I = lambda : int(input())
  S = lambda : input()
  M = lambda : map(int, input().split())
  Ms = lambda : map(str, input().split()) 
  ARR = lambda : list(map(int, input().split()))
  
  dp = []
  def precalculate():
  	def isValid(n):
  		if n%3==0 or n%10==3: return False
  		return True
  	num = 1
  	while len(dp) != 1000:
  		if isValid(num): dp.append(num)
  		num += 1
  
  def solve():
  	k = I()
  	print(dp[k-1])
  
  precalculate()
  tc = I()
  for _ in range(tc):
  	solve()