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 sys import stdin
  
  input = lambda: stdin.readline().strip()
  linput = lambda: [*map(int, input().split())]
  output = []
  
  
  def lprint(*x):
      output.append(' '.join(map(str, x)))
  
  
  a = []
  
  for i in range(1, 1000000):
      if len(a) > 1000:
          break
      if i % 3 and i % 10 != 3:
          a.append(i)
  
  
  def main():
      lprint(a[int(input()) - 1])
  
  
  if __name__ == '__main__':
      for _ in ' ' * int(input()):
          main()
      print(*output, sep='\n')
  