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.lang.Math;
  public class Main
  {
  	public static void main(String[] args)throws IOException {
  		InputStreamReader r=new InputStreamReader(System.in);    
         BufferedReader br=new BufferedReader(r); 
         int t = Integer.parseInt(br.readLine());
         int[] arr = new int[]{1,64, 729, 4096, 15625, 46656, 117649, 262144, 531441, 1000000, 1771561, 2985984, 4826809, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64000000, 85766121, 113379904,148035889, 191102976, 244140625, 308915776, 387420489,481890304, 594823321, 729000000, 887503681};
         for(int i=0; i<t; i++)
         {
             double sqr = Double.parseDouble(br.readLine());
             double sqrroot= Math.sqrt(sqr);
             double cbrroot= Math.cbrt(sqr);
             int sum = (int) sqrroot;
             sum += (int) cbrroot;
             //System.out.print(sum + " ");
             int num = (int) sqr;
             for(int j=0; j<arr.length; )
              {   
                  
                  if(num>=arr[j])
                  {
                      j++;
                  }
                  else
                  {   
                      //System.out.print(j + " ");
                      sum -= j;
                      break;
                  }
                  if(j==arr.length)
                  {
                      sum -= j;
                  }
              }
             System.out.println(sum);
             
         }
  	}
  }