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: t = int(input())
  
  for i in range(t):
      n = int(input())
      c = int(round(n**(1/3),0))
      s = int(round(n**(1/2),0))
      lc=ls=[]
      for i in range(1,c+1):
          lc.append(i**3)
      for i in range(1,s+1):
          ls.append(i**2)
      a = [i for i in lc if i>n]
      b = [i for i in ls if i>n]
      a=set(a)
      b=set(b)
      lc=set(lc)
      lc=lc.difference(a)
      ls=set(ls)
      ls=ls.difference(b)
      k=lc.union(ls)
      print(len(k))