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: tot = int(input())
  for i in range(tot):
      
      num = int(input())
  
      lst = []
      count = 0
  
      for i in range (3*num):
      
          lst.append(str(i))
          i += 1
      
      for i in range (3*num):
      
          if lst[i][len(lst[i])-1] == "3" or int(lst[i])%3 == 0 :
          
              lst[i] = 0
          
      for i in range (3*num):    
      
          if lst[i] != 0:
          
              count +=1
  # =============================================================================
  #             print(f'count is {count}, i is {i}')
  #         
  # =============================================================================
          if count == num:
          
              print(i)
              break
      
  
      
      