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,sys
  #from itertools import permutations, combinations;import heapq,random;
  #from collections import defaultdict,deque
  import bisect as bi
  def yes():print('YES')
  def no():print('NO')
  #sys.stdin=open('input.txt','r');sys.stdout=open('output.txt','w');
  def I():return (int(sys.stdin.readline()))
  def In():return(map(int,sys.stdin.readline().split()))
  def Sn():return sys.stdin.readline().strip()
  #sys.setrecursionlimit(1500)
  def dict(a):
      d={} 
      for x in a:
          if d.get(x,-1)!=-1:
              d[x]+=1
          else:
              d[x]=1
      return d
  def find_gt(a, x):
      'Find leftmost value greater than x'
      i = bi.bisect_left(a, x)
      if i != len(a):
          return i
      else:            
          return -1
  def main():
      try:
          dp=[]
          i=0
          for j in range(5000):
              i+=1
              if i%10==3 or i%3==0:
                  continue
              dp.append(i)
          for k in range(I()):
              a=I()
              print(dp[a-1])
      except:
          pass
          
  M = 998244353
  P = 1000000007
   
  if __name__ == '__main__':
      # for _ in range(I()):main()
      for _ in range(1):main()
  #End#
  
  #        ******************* All The Best *******************   #