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: t = int(input())
  
  import math
  
  while t != 0:
      n = int(input())
  
      sq = int(math.sqrt(n))
      cub = int(math.pow(n, 1/3))
      if (cub+1)*(cub+1)*(cub+1) == n:
          cub += 1
      # while True:
      #     x = int(pow(c, 0.5))
      #     y = int(pow(c, 1/3))
          
      #     if x*x == c and sq == None:
      #         sq = x
      #     if y*y*y == c and cub == None:
      #         cub = y
          
      #     if (sq != None and cub != None) or c < 1:
      #         break
      #     c -= 1
      if cub == 0:
          temp = 0
      else:
          temp = int(math.sqrt(cub))
      c = cub
      # while True:
      #     x = int(pow(c, 0.5))
      #     # print(x, c)
      #     if x*x == c and temp == None:
      #         temp = x
      #         break
          
      #     c-=1
      #     if c < 1:
      #         break
      # if temp == None:
      #     temp = 0
      # print(sq, cub, temp)
      print(sq+cub-temp)
      t -= 1