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: from math import ceil, log2, floor,sqrt,gcd
  from collections import defaultdict,deque
  from bisect import bisect_left
  import sys
  import os.path
  from itertools import permutations
  sys.setrecursionlimit(200000)
  if (os.path.exists('input.txt')):
      sys.stdin = open("input.txt", "r+")
      sys.stdout = open("output.txt", "w")
  
  
  # input = sys.stdin.readline
  # print=sys.stdout.write
  def MI():
      return map(int, input().split())
  
  mod=10**9+7
  
  
  
  def solve(testcase):
      n = int(input())
      # a=list(MI())
      ans=0
      d=defaultdict(bool)
      for i in range(1,int(n**(1/2))+1):
          # print(i)
          a=i**2
          b=i**3
          if d[a]==False and a<=n:
              ans+=1
              d[a]=True
          if d[b]==False and b<=n:
              ans+=1
              d[b]=True
  
         
      print(ans)
      
  
  
      
      
      
  t=int(input())
  # t=1
  for _ in range(t):
      solve(_+1)
  
  