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.StringTokenizer;
  
  import static java.lang.Double.parseDouble;
  import static java.lang.Integer.parseInt;
  import static java.lang.Long.parseLong;
  import static java.lang.System.in;
  import static java.lang.System.out;
  
  public class Squares_and_Cubes {
      public static void main(String[] args) {
          try {
              FastReader in = new FastReader();
              FastWriter out = new FastWriter();
              int test = in.nextInt();
              while (test > 0) {
                  //Your Code Here
                  long n = in.nextLong();
                  out.println(calc(n));
                  test--;
              }
              out.close();
          } catch (Exception e) {
              return;
          }
  
      }
  
      private static long calc(long n) {
          long square = (long) Math.sqrt(n);
        //  out.println("s "+ square);
          long cube = (long) Math.cbrt(n);
         // out.println("C "+cube);
         // out.println("bETWEEN "+ (long) Math.sqrt(cube));
          //out.println(square + cube - (long) Math.cbrt(square));
          return (square + cube - (long) Math.sqrt(cube));
      }
  
      static class FastWriter {
          private final BufferedWriter bw;
  
          public FastWriter() {
              this.bw = new BufferedWriter(new OutputStreamWriter(out));
          }
  
          public void print(Object object) throws IOException {
              bw.append("" + object);
          }
  
          public void println(Object object) throws IOException {
              print(object);
              bw.append("\n");
          }
  
          public void close() throws IOException {
              bw.close();
          }
      }
  
      public static class FastReader {
          BufferedReader br;
          StringTokenizer st;
  
          public FastReader() {
              br = new BufferedReader(new InputStreamReader(in));
          }
  
          String next() {
              while (st == null || !st.hasMoreTokens()) {
                  try {
                      st = new StringTokenizer(br.readLine());
                  } catch (IOException e) {
                      e.printStackTrace();
                  }
              }
              return st.nextToken();
          }
  
          int nextInt() {
              return parseInt(next());
          }
  
          long nextLong() {
              return parseLong(next());
          }
  
          double nextDouble() {
              return parseDouble(next());
          }
  
          String nextLine() {
              String str = "";
              try {
                  str = br.readLine().trim();
              } catch (Exception e) {
                  e.printStackTrace();
              }
              return str;
          }
      }
  }
  