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 java.io.*;
  import java.util.*;
  
  public class Main{
  
      static class FastReader {
          BufferedReader br;
          StringTokenizer st;
   
          public FastReader()
          {
              br = new BufferedReader(
                  new InputStreamReader(System.in));
          }
   
          String next()
          {
              while (st == null || !st.hasMoreElements()) {
                  try {
                      st = new StringTokenizer(br.readLine());
                  }
                  catch (IOException e) {
                      e.printStackTrace();
                  }
              }
              return st.nextToken();
          }
   
          int nextInt() { return Integer.parseInt(next()); }
   
          long nextLong() { return Long.parseLong(next()); }
   
          double nextDouble()
          {
              return Double.parseDouble(next());
          }
   
          String nextLine()
          {
              String str = "";
              try {
                  str = br.readLine();
              }
              catch (IOException e) {
                  e.printStackTrace();
              }
              return str;
          }
      }
      
      
      static long countSC(long N)
  {
      long res = (long)Math.sqrt(N) +
                (long)Math.cbrt(N) -
                (long)(Math.sqrt(Math.cbrt(N)));
   
      return res;
  }
  
  
  public static void main(String[] args) throws Exception {
  
  
      FastReader sc = new FastReader();
      
     int testcase=sc.nextInt();
    while(testcase-->0)
    {
        
        
        for(int i=0;i<10000;i++);
        
        
        for(int i=0;i<10000;i++)
        {
            i++;
        }
        
        
        int m=1000009;
        while(m>=0)
        {
            m--;
        }
        
        
        
        for(int i=0;i<10000;i++)
        {
            i++;
        }
        
        
        
        
        long n=sc.nextInt();
        System.out.println(countSC(n));
        
        
        
        for(int i=0;i<10000;i++)
        {
            i++;
        }
    }
  		
  		
  }
  }