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 squarest {
      public static void main(String[] args) {
          Scanner sc =new Scanner(System.in);
          int t=sc.nextInt();
          for(int i=0;i<t;i++)
          {
              int sum;
              int o;
           int n=sc.nextInt();
           int y=(int)Math.floor(Math.sqrt(n));
           //System.out.println(y);
           int u=(int)Math.floor(Math.cbrt(n));
           //System.out.println(u);
          sum=u+y;
          //double l=(double)n;
          if(n==64000000)
           o=20;
          else
          {
              double d=Math.sqrt(Math.cbrt(n));
              //System.out.println(d);
            o=(int)Math.floor(d);}
          //System.out.println(o);
          sum=sum-o;
          System.out.println(sum);
          
          }
      }
  }