description: Polycarp likes squares and cubes of positive integers. Here is the beginning of the sequence of numbers he likes: 1, 4, 8, 9, ....
  
  For a given number n, count the number of integers from 1 to n that Polycarp likes. In other words, find the number of such x that x is a square of a positive integer number or a cube of a positive integer number (or both a square and a cube simultaneously).
  
  Input
  
  The first line contains an integer t (1 ≤ t ≤ 20) — the number of test cases.
  
  Then t lines contain the test cases, one per line. Each of the lines contains one integer n (1 ≤ n ≤ 10^9).
  
  Output
  
  For each test case, print the answer you are looking for — the number of integers from 1 to n that Polycarp likes.
  
  Example
  
  Input
  
  
  6
  10
  1
  25
  1000000000
  999999999
  500000000
  
  
  Output
  
  
  4
  1
  6
  32591
  32590
  23125
solution: # square or a cube
  # simple dp
  from bisect import bisect_left
  
  # squares and cubes till int(1e9)
  dp = set()
  
  def generate_items():
      global dp
      
      i = 1
      while i**2 <= int(1e9):
          dp.add(i**2)
          dp.add(i**3)
          i += 1
          
  
  def answer(x):
      if x in dp:
          return dp.index(x)+1
      else:
          return bisect_left(dp, x)
  
  generate_items()
  dp = sorted(list(dp))
  for _ in range(int(input())):
      print(answer(int(input())))