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: # '''
  #      |\_/|                  
  #      | @ @   Woof! 
  #      |   <>              _  
  #      |  _/\------____ ((| |))
  #      |               `--' |   
  #  ____|_       ___|   |___.' 
  # /_/_____/____/_______|
  # I am here to guard this code, woof!
  # '''
   
  import sys
  from sys import stdin, stdout
  from math import ceil, floor, sqrt, log, log2, log10
  from collections import Counter
   
  int_max = float('inf')
  int_min = -(float('inf'))
  ANS = []
  # infile = open(sys.argv[1], "r")
  # input = infile.readline
  input = stdin.readline
   
  def solve():
      pass
   
  t = int(input())
  # t = 1
   
  for i in range(t):
      k = int(input())
      # n, k = map(int, input().split())
      # arr =  list(map(int, input().split()))
      # arr = list(input())
      # s = input()
      i = 1
      ans = 0
      start = 1
      while True:
  
          if str(start)[-1] != '3' and start%3 != 0:
              if i == k:
                  ans = start
                  break
              else:
                  i += 1
  
          start += 1
      print(ans)    
  print('\n'.join(ANS))