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())
  count = 0
  a = True
  l = set()
  li = []
  
  for _ in range(0,t):
      n = int(input())
      r = int(math.sqrt(n))
      #print("RRRR", r)
      for i in range(1,r+1):
          if i == 1:
              count += 1
              l.add(1)
              continue
              
          double_i = i**2
          if double_i <= n:
              count += 1
              l.add(double_i)
          else:
              break
          
          cube_i = i ** 3
          if cube_i <= n and a:
              count += 1
              l.add(cube_i)
          else:
              a = False
              
      li.append(len(l))
      l = set()
      count = 0
      a= True
      
  for x in li:
      print(x)
      
          