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.*;
  import java.util.*;
  
  public class B {
      static ArrayList<Long> ls;
  
      public static void main(String args[]) {
          Scanner in = new Scanner(System.in);
          PrintWriter pw = new PrintWriter(System.out);
  
          int t = in.nextInt();
          build();
          for (int tt = 0; tt < t; tt++) {
              long ans = lower(ls, ls.size(), in.nextLong());
              pw.println(ans + 1);
          }
          pw.close();
      }
  
      static void build() {
          ls = new ArrayList<>();
          HashSet<Long> set = new HashSet<>();
          for (long i = 1; ; i++) {
              long v = i * i;
              long cub = i * i * i;
              if (v > (long) 1e9 && cub > (long) 1e9) break;
              if (v <= (long) 1e9) {
                  if (!set.contains(v)) {
                      ls.add(v);
                      set.add(v);
                  }
              }
              if (cub <= (long) 1e9) {
                  if (!set.contains(cub)) {
                      ls.add(cub);
                      set.add(cub);
                  }
              }
          }
          Collections.sort(ls);
      }
  
      static int lower(ArrayList<Long> ls, int n, long val) {
          int ind = 0;
          int left = 0, right = n - 1;
          while (left <= right) {
              int mid = (left + right) / 2;
              if (ls.get(mid) <= val) {
                  left = mid + 1;
                  ind = mid;
              } else right = mid - 1;
          }
          return ind;
      }
  
  
      static void debug(Object... obj) {
          System.err.println(Arrays.deepToString(obj));
      }
  }