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.ArrayList;
  import java.util.Arrays;
  import java.util.Scanner;
  
  public class test2 {
  
          // Function to count cubes between two numbers
          static long countCubes(long a, long b)
          {
              return (long) (Math.floor(Math.cbrt(b)) -
                      Math.ceil(Math.cbrt(a)) + 1);
          }
          static long countSquares(long a, long b)
          {
              return (long) (Math.floor(Math.sqrt(b)) - Math.ceil(Math.sqrt(a)) + 1);
          }
      static boolean squareString(String s){
          int j = (s.length()/2);
          int i=0;
          while(j<s.length()){
              if(s.charAt(i++)!=s.charAt(j++)) return false;
          }
          return true;
      }
  
      public static void main(String[] args) {
          Scanner sc = new Scanner(System.in);
          long j=1;
          ArrayList<Long> check = new ArrayList<>();
          for(int i=1; i<32; i++){
              j= (long) Math.pow(i,6);
              check.add(j);
          }
          int t = sc.nextInt();
          while(t-->0){
              long n=sc.nextLong();
              long countSq = countSquares(1,n);
              long countCu = countCubes(1,n);
              long sum = countCu+countSq;
              int double_count = 0;
              while(double_count< check.size() && check.get(double_count)<=n) double_count++;
              System.out.println(sum-double_count);
          }
      }
  }
  