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: n = int(input())
  answer = []
  k = []
  for i in range(n):
      s = int(input())
      answer.append(s)
  for j in answer:
      ans = {1: 1}
      if j < 4:
          k.append(1)
      elif j < 8:
          k.append(2)
      else:
          for i in range(2, j // 2 + 1):
              if i ** 3 <= j:
                  ans[i ** 3] = ans.get(i ** 3, 0) + 1
                  ans[i ** 2] = ans.get(i ** 2, 0) + 1
              elif i ** 2 <= j:
                  ans[i ** 2] = ans.get(i ** 2, 0) + 1
              else:
                  k.append(len(ans))
                  break
  for i in k:
      print(i)
  
  '''
  20
  511987557
  940318563
  397150475
  454087385
  354269461
  613861695
  211176104
  419833326
  505148301
  319706849
  213732674
  655143258
  485034974
  341893134
  696107438
  892474645
  801724293
  205267813
  941783222
  940658655
  '''
  