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.Scanner;
  import java.util.HashSet;
  
  public final class Solution {
      public static void main(String[] args) {
          Scanner s = new Scanner(System.in);
          String line = s.nextLine();
          Integer lineI = Integer.parseInt(line);
          
          for(int i=0; i<lineI; i++) {
              String x = s.nextLine();
              
              System.out.println(calc(Integer.parseInt(x)));
             
          }
      }
      
        public static int calc(int num) {
          HashSet<Double> h = new HashSet();
          Integer sq = (int)Math.sqrt(num);
          for(int i = 1; i <= sq; i++) {
              if(Math.pow((double) i,2.0) <= (double) num ) {
                  h.add(Math.pow((double) i,2.0));
                  //System.out.println(i*i);
              }
  
              if (Math.pow((double) i,3.0) <= (double)num) {
                  h.add(Math.pow((double) i,3.0));
                  //System.out.println(i*i*i);
              }
  /*
              if (Math.pow((double) i,5.0) <= (double)num) {
                  //h.add(Math.pow((double) i,5.0));
                  //System.out.println(i*i*i*i*i);
              }*/
          }
          return h.size();
      }
  }