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 math
  t = int(input())
  l = []
  for i in range (0,t):
      l.append(int(input()))
  for i in range (0,t):
          sq = l[i]**0.5
          sq = math.floor(sq)
          if (sq+1)**2 <= l[i]:
              sq = sq + 1
          cb = l[i]**(1/3)
          cb = math.floor(cb)
          if (cb+1)**3 <= l[i]:
              cb = cb + 1
          sr = l[i]**(1/6)
          sr = math.floor(sr)
          if (sr+1)**6 <= l[i]:
              sr = sr + 1
          print(sq+cb-sr)
  
  