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.util.*;
  
  public class sol {
      public static void main(String[] args) {
          Scanner sc = new Scanner(System.in);
          int t = sc.nextInt();
  
          for (int i = 0; i < t; i++) {
              int n  = sc.nextInt();
  
              System.out.println((find1(n)+find2(n)));
          }
      }
  
      public static int find1(int n){
  //        System.out.println(Math.floor(Math.sqrt(n)) - Math.ceil(Math.sqrt(1)) + 1);
          int count = 0;
  
          for(int i = 1; i <= Math.sqrt(n); ++ i)
              if(!isPerfectCube(i * i))
                  count ++;
  
  //        System.out.println(count);
          return count;
      }
  
      private static boolean isPerfectCube(long number)
      {
          long cube_root = (long)Math.cbrt(number);
          return cube_root * cube_root * cube_root == number;
      }
  
      public static int find2(int n){
          return (int) (Math.floor(Math.cbrt(n)));
          }
  
  }
  