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: 
  if __name__ == '__main__':
      numbers = []
      maxim = 1000000000
      numbers.append(1)
      square = 2
      cube = 2
      while cube * cube * cube <= maxim:
          while square * square < cube * cube * cube:
              numbers.append(square * square)
              square = square + 1
          numbers.append(cube * cube * cube)
          if square * square == cube * cube * cube:
              square = square + 1
          cube = cube + 1
  
      t = int(raw_input())
      for i in range(0, t):
          n = int(raw_input())
          index = 0
          result = 0
          while index < len(numbers) and numbers[index] <= n:
              result = result + 1
              index = index+1
          print(result)
          print("\n")
  