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: //package Codeforces.Div3.R762;
  
  import java.io.*;
  import java.util.*;
  import java.nio.file.*;
  
  public class B {
      public static FastIO io;
  
      public static void main(String[] args) throws IOException {
  
          boolean fileInOut = !B.class.getPackage().getName().isEmpty();
          io = new FastIO(fileInOut);
  
          int totalTC = fileInOut ? io.nextInt() : io.nextInt();
          for (int t = 1; t <= totalTC; t++) {
              int N = io.nextInt();
              new B().solution(N);
          }
  
          if (fileInOut) {
              String[] ansFileText = Files.readAllLines(Paths.get("ans.txt")).toArray(new String[0]);
              String[] outFileText = Files.readAllLines(Paths.get("out.txt")).toArray(new String[0]);
              if (Arrays.equals(ansFileText, outFileText)) System.out.println("ALL TEST CASES PASSED!");
              else {
                  for (int i = 0; i < ansFileText.length; i++) {
                      if (i >= outFileText.length) {
                          System.out.println("<NO OUTPUT> ------> " + ansFileText[i]);
                      } else if (!ansFileText[i].equals(outFileText[i])) {
                          System.out.println(outFileText[i] + " ------> " + ansFileText[i]);
                      } else {
                          System.out.println(outFileText[i]);
                      }
                  }
              }
          }
      }
  
      public void solution(int n) {
          // 1   4   8   9
          // 1 2^2 2^3 3^2
          var set = new HashSet<Integer>();
          for (int i = 1; i*i <= n; i++) {
              set.add(i*i);
          }
  
          for (int i = 2; i*i*i <= n; i++) {
              set.add(i*i*i);
          }
  
          io.println(set.size());
      }
  
      static class FastIO extends PrintWriter {
          BufferedReader br;
          StringTokenizer st;
  
          public FastIO(boolean fileInOut) throws FileNotFoundException {
              super(fileInOut ? new FileOutputStream("out.txt") : System.out, true);
              br = new BufferedReader(new InputStreamReader(fileInOut ? new FileInputStream("in.txt") : System.in));
          }
  
          String next() {
              while (st == null || !st.hasMoreElements()) {
                  try {
                      st = new StringTokenizer(br.readLine());
                  } catch (IOException e) {
                      e.printStackTrace();
                  }
              }
              return st.nextToken();
          }
  
          int nextInt() {
              return Integer.parseInt(next());
          }
  
          long nextLong() {
              return Long.parseLong(next());
          }
  
          double nextDouble() {
              return Double.parseDouble(next());
          }
  
          String nextLine() {
              String str = "";
              try {
                  str = br.readLine();
              } catch (IOException e) {
                  e.printStackTrace();
              }
              return str;
          }
  
          int[] nextInts() {
              int N = nextInt();
              int[] res = new int[N];
              for (int i = 0; i < N; i++) {
                  res[i] = (int) nextLong();
              }
              return res;
          }
  
          int[] nextInts(int N) {
              int[] res = new int[N];
              for (int i = 0; i < N; i++) {
                  res[i] = (int) nextLong();
              }
              return res;
          }
  
          void print(int[] n) {
              if (n.length == 0) return;
              for (int i = 0; i < n.length - 1; i++) {
                  io.print(n[i] + " ");
              }
              io.println(n[n.length - 1]);
          }
  
          void print(List<Integer> n) {
              if (n.size() == 0) return;
              for (int i = 0; i < n.size() - 1; i++) {
                  io.print(n.get(i) + " ");
              }
              io.println(n.get(n.size() - 1));
          }
      }
  }
  