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 sys
  import math
  
  if sys.subversion[0] == "PyPy":
      import io, atexit
  
      sys.stdout = io.BytesIO()
      atexit.register(lambda: sys.__stdout__.write(sys.stdout.getvalue()))
  
      sys.stdin = io.BytesIO(sys.stdin.read())
      input = lambda: sys.stdin.readline().rstrip()
  
  t = int(raw_input())
  
  # python codesforces210710.py < input.txt
  for zz in range(t):
      # n, r1, r2, r3, d = map(int, str1)
  
      n = int(raw_input())
      k = 0
      #print(n)
      i = 0
      while k < n:
          i += 1
          j = i % 10
          if i % 3 != 0 and j != 3:
              k += 1
          #print(i, k, j)
      print(i)