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.Reader;
  import java.util.*;
  public class One00 {
  
      public static void main(String[] args) {
          Scanner scan = new Scanner(System.in);
          int t = scan.nextInt();
  //        System.out.println(Math.sqrt(1000000000));
  //        System.out.println(Math.sqrt(1000000000-1));
          while(t-->0){
              int n = scan.nextInt();
              Set<Integer> set = new HashSet<>();
              set.add(1);
              for (int i = 1; i <= n; i++) {
  
                  if(i*i>n)break;
                  set.add(i*i);
              }
              for (int i = 1; i < n; i++) {
                  if(i*i*i>n)break;
                  set.add(i*i*i);
              }
              System.out.println(set.size());
          }
      }
  
      public static double sq2(long a){
  
          return Math.pow(a,0.5);
  
      }
  
      public static double sq3(long a){
  
          return Math.pow(a,1.0/3);
  
      }
  
  
  
  
  
  }