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: import sys, array, bisect, collections, heapq, itertools, math, functools
  sys.setrecursionlimit(100000)
  
  def _r(): return sys.stdin.buffer.readline()
  def rs(): return _r().decode('ascii').strip()
  def rn(): return int(_r())
  def rnt(): return tuple(map(int, _r().split()))
  def rnl(): return list(rnt())
  def rna(): return array.array('q', rnt())
  def pnl(l): print(' '.join(map(str, l)))
  
  def solve(n):
      sol = 0
      s = 1
      while s**2 <= n:
          sol += 1
          s += 1
      q = 1
      while q**3 <= n:
          sq = int(math.sqrt(q**3))
          if sq**2 != q**3:
              sol += 1
          q += 1
      return sol
  
  for _ in range(rn()):
      print(solve(rn()))