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 Solution {
      public static void main(String[] args) {
          Scanner scan = new Scanner(System.in);
          int Test = scan.nextInt();
          for(int i=0;i<Test;i++)
          {
              long n = scan.nextLong();
              long Square = findNumber(n, true);
              long cube = findNumber(n, false);
  //            System.out.println("Square: "+Square);
  //            System.out.println("Cube: "+cube);
              HashSet<Integer> set = new HashSet<>();
              for(int j=1;j<=(int)Square;j++)
              {
                  set.add((int)Math.pow(j,2));
              }
              for(int j=2;j<=(int)cube;j++)
              {
                  set.add((int)Math.pow(j,3));
              }
              System.out.println(set.size());
          }
      }
      public static long findNumber(long n, boolean sq){
          long high = n;
          long low = 1;
          if(n==1)return 1;
          long mid = 0;
          long pow = 2;
          if(!sq)pow=3;
          while(high-low>1){
              mid = (high + low)/2;
              if(Math.pow(mid, pow) == n)return mid;
              else if(Math.pow(mid, pow) > n)
              {
                  high = mid;
              }
              else {
                  low = mid;
              }
          }
          if(Math.pow(high, pow) <= n)return high;
          return low;
      }
  }