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 __future__ import unicode_literals
  from __future__ import print_function
  import time
  import math
  import random
  def func():
      m=1000000000
      j=63
      while (j<m):
          num1=j**(1/2)
          num2=j**(1/3)
          if (isint(num1)==True and isint(num2)==True):
              print(j)
          j+=1
  def isint(s):
      try:
          int(s)
          return True
      except ValueError:
          return False
  
  #main
  #func()
  a= int(input())
  i=0
  while i<a:
      j=0
      chislo=int(input())
      slag1=chislo**(1/2)
      slag1+=0.000000000001
      slag2=pow(chislo,(1/3))
      slag2 += 0.000000000001
      vich=chislo**(1/6)
      vich += 0.000000000001
      vich=int(vich)
      slag1=int(slag1)
      slag2=int(slag2)
      answer=slag1+slag2-vich
      print(answer)
      i+=1#end of cycl