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: from collections import defaultdict, deque
  from itertools import permutations, combinations, product
  from functools import lru_cache
  from math import factorial
  def pprint(E): 
      for e in E: print(e)
  from sys import setrecursionlimit, stdin
  setrecursionlimit(500000)
  readline = stdin.readline
  # @lru_cache(maxsize=None)
  INF = 10 ** 18
  MOD = 1000000007
  MOD2 = 998244353
  cnt = ans = tmp = 0
  yes, no = 'Yes', 'No'
  yn = yes
  def I(): return int(readline())
  def S(): return readline()[:-1]
  def LI(): return list(map(int, readline().split()))
  def SPI(): return map(int, readline().split())
  def FIE(x): return [readline()[:-1] for _ in [0]*x]
  def ENU(x): return enumerate(x)
  def NODE(x): return [[] for _ in [0]*(x+1)]
  def ZERO(x): return [0]*x
  def ZEROS(y, x): return [[0]*x for _ in [0]*y]
  def ZEROSS(z, y, x): return [[[0]*x for _ in [0]*y] for _ in [0]*z]
  ####################################################################
  
  n = I()
  M = []
  for i in range(1, 2000):
      if i % 3 == 0: continue
      if str(i)[-1] == '3': continue
      M.append(i)
  
  for _ in range(n):
      k = I()
      print(M[k-1])
  