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
  import bisect
  import copy
  from collections import defaultdict
  from collections import OrderedDict
  from sys import stdout
  
  import sys 
  # For getting input from input.txt file 
  #sys.stdin = open('input.txt', 'r')  
    
  # Printing the Output to output.txt file 
  #sys.stdout = open('output.txt', 'w') 
      
      
  
  for _ in range(int(input())):
      #n,l,r = map(int,input().split())
      #s = input()
      n = input()
      #pro = list(map(int,input().split()))
      #pol = list(map(int,input().split()))
      #m = len(s)
      #n = len(q)
  
      k = 0
      res = 0
      
      while k <= int(n) :
  
          p = str(res)
  
          if p[-1] != '3' and res%3 != 0:
  
              k += 1
  
          if k == int(n) and p[-1] != '3' and res%3 != 0:
              print(res)
              break
  
  
          res += 1
  
  
          
  
              
  
          
  
      
  