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: # -----------------FAST IO-------------------------
  import os
  import sys
  from io import BytesIO, IOBase
  
  BUFSIZE = 8192
  
  
  class FastIO(IOBase):
      newlines = 0
  
      def __init__(self, file):
          self._fd = file.fileno()
          self.buffer = BytesIO()
          self.writable = "x" in file.mode or "r" not in file.mode
          self.write = self.buffer.write if self.writable else None
  
      def read(self):
          while True:
              b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
              if not b:
                  break
              ptr = self.buffer.tell()
              self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
          self.newlines = 0
          return self.buffer.read()
  
      def readline(self):
          while self.newlines == 0:
              b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
              self.newlines = b.count(b"\n") + (not b)
              ptr = self.buffer.tell()
              self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
          self.newlines -= 1
          return self.buffer.readline()
  
      def flush(self):
          if self.writable:
              os.write(self._fd, self.buffer.getvalue())
              self.buffer.truncate(0), self.buffer.seek(0)
  
  
  class IOWrapper(IOBase):
      def __init__(self, file):
          self.buffer = FastIO(file)
          self.flush = self.buffer.flush
          self.writable = self.buffer.writable
          self.write = lambda s: self.buffer.write(s.encode("ascii"))
          self.read = lambda: self.buffer.read().decode("ascii")
          self.readline = lambda: self.buffer.readline().decode("ascii")
  
  
  # sys.stdin = open('input.txt', 'r')
  # sys.stdout = open('output.txt', 'w')
  # sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
  # input = lambda: sys.stdin.readline().rstrip("\r\n")
  
  #---------------------------------------------------
  
  import math
  import collections
  from itertools import permutations
  from itertools import combinations
  
  
  '''def is_prime(n):
      j=2
      while j*j<=n:
          if n%j==0:
              return 0
          j+=1
      return 1'''
  
  
  '''def gcd(x, y):
      while(y):
          x, y = y, x % y
      return x'''
  
  '''fact=[]
  def factors(n) :
       
      i = 1
      while i <= math.sqrt(n):
           
          if (n % i == 0) :
               
              if (n / i == i) :
                  fact.append(i)
  
              else :
      
                  fact.append(i)
                  fact.append(n//i)
          i = i + 1'''
  # def LCMofArray(a):
  #   lcm = a[0]
  #   for i in range(1,len(a)):
  #     lcm = lcm*a[i]//math.gcd(lcm, a[i])
  #   return lcm
  def prob():
      
      n = int(input())
      # n,k=[int(x) for x in input().split()]
      # s = input()
      # l = [int(x) for x in input().split()]
      # m = [x for x in input().split()]
  
      
      st = set()
  
      for i in range(1,n+1):
  
          if i*i > n:
              break
  
          st.add(i*i)
  
      for i in range(1,n+1):
  
          if i*i*i > n:
              break
  
          st.add(i*i*i)
  
      print(len(st))
  
      
  #sys.stdin , sys.stdout = open('input.txt', 'r') , open('output.txt', 'w')
  sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
  input = lambda: sys.stdin.readline().rstrip("\r\n")
  
  t=1
  t=int(input())
  
  for _ in range(0,t):
      # print("Case #" , end="")
      # print(_+1 , end=": ")
      prob()