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.Arrays;
  import java.util.HashSet;
  import java.util.Scanner;
  import java.util.Set;
  
  public class problems {
      public static void main(String []args){
          Scanner sc = new Scanner(System.in);
          int t= sc.nextInt();
          sc.nextLine();
          Set<Double>set1 = new HashSet<>();
          Set<Double>set2 = new HashSet<>();
          for (int  i = 1 ; i<=1000;i++){
              set1.add(Math.pow(i,3));
          }
          for (long  i = 1 ; i<31700;i++){
              set2.add(Math.pow(i,2));
          }
          while (t>0){
              t--;
              int n =sc.nextInt();
              int counter =0;
             /* for (double  i =1 ; i<=n;i++){
                  if(set1.contains(i)|| set2.contains(i)){
                      counter++;
                  }
              }
              System.out.println(counter);
              */
              Set<Double> set = new HashSet<>();
              for (int  i = 1 ; i<=n ;i++){
                  if( Math.pow(i,3)<=n){
                      counter++;
                      set.add(Math.pow(i,3));
                  }
                  if(Math.pow(i,2)<=n&&!set.contains(Math.pow(i,2))){
                      counter++;
                  }
                  if(Math.pow(i,2)>n){
                      break;
                  }
  
              }
              System.out.println(counter);
          }
      }
  }
  