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
  import os.path
   
  if(os.path.exists('input.txt')) :
      sys.stdin = open("input.txt", "r")
      sys.stdout = open("output.txt", "w")
      sys.stderr = open("error.txt", "w")
      
  depth = 200001
  mod = 1000000007 
  lim = mod * mod
  sys.setrecursionlimit(depth) 
   
  linp = lambda: list(minp())
  minp = lambda: map(int, input().split())
   
  from math import inf, ceil, sqrt, log2, gcd
  from collections import defaultdict, deque
  
  dxy = [(1, 0),(-1, 0),(0, 1),(0, -1)]
  
  def expo(a, b) :
      if not b : return 1
      v = expo(a, b//2)
      v = (v * v) % mod
      if b%2 : v = (v * a) % mod
      return v
  
  def modinv(a, b) :
      d = expo(b, mod-2)
      v = (a * d) % mod
      return v
  
  def checkPrime(n) :
      if n < 4 : return True
      if n%2 == 0 : return False
      for i in range(3, int(sqrt(n))+1, 2) :
          if n%i == 0 :
              return False
      return True    
  
  def highestPowerof2(x):
      x |= x >> 1
      x |= x >> 2
      x |= x >> 4
      x |= x >> 8
      x |= x >> 16
  
      return x ^ (x >> 1)
  
  for _ in range(int(input())) :
      n = int(input())
      s, i = set(), 1
      while i*i <= n :
          s.add(i*i)
          i += 1
      i = 1
      while i*i*i <= n :
          s.add(i*i*i)
          i += 1
      print(len(s))