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.lang.*;
  import java.util.HashSet;
  import java.util.Scanner;
  import java.util.Set;
  
  public class Contest1453 {
      public static void main(String[] args) {
          Scanner ip=new Scanner(System.in);
          int q=ip.nextInt();
          ip.nextLine();
          for(int i=0;i<q;i++)
          {
              int  x=ip.nextInt();
              System.out.println(util_2(x));
  
          }
      }
      public static int util_2(int x)
      {
          Set<Integer> set=new HashSet<>();
          int sq=(int)Math.sqrt(x);
          for(int i=1;i<=sq;i++)
          {
              int two= (int) Math.pow(i, 2);
              int three=(int) Math.pow(i, 3);
              if(two<=x)
                  set.add(two);
              if(three<=x)
                  set.add(three);
          }
          return set.size();
      }
      public static String util_Q1(String s)
      {
          int n=s.length();
          int mid=n/2;
          if(n%2==1)
              return "NO";
          String last=s.substring(mid, n);
          String first=s.substring(0, mid);
  
          return (first.equals(last))?"YES":"NO";
      }
  }
  