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 MyClass {
      public static void main(String args[]) {
         
         Scanner sc = new Scanner(System.in);
         int t = sc.nextInt();
         
         while(t>0){
             long n = sc.nextLong();
             Set<Long> s = new HashSet<Long>();
             int sqr=0;
         for(int i=1; i<=n; i++){
             sqr = i*i;
             if(sqr>n){
                 sqr=(i-1);
                 break;
             }
         }
         int cube=0;
          for(int i=1; i<=n; i++){
             cube = i*i*i;
             if(cube>n){
                 cube = (i-1);
                 break;
             }
         }
        
         for(int i=1; i<=sqr; i++){
             long sqrRoot = i*i;
             if(i<=cube){
                 long cubeRoot = i*i*i;
                 s.add(cubeRoot);
             }
             
             if(sqrRoot>n){
                 break;
             }
             else{
                 if(sqrRoot<=n){
                      s.add(sqrRoot);
                  }
             }
         }
          System.out.println(s.size());
             t--;
         }
         
      }
  }