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.Arrays;
  import java.util.HashSet;
  import java.util.Random;
  import java.util.StringTokenizer;
  
  public class codeforces_762_B {
      private static void solve(FastIOAdapter in, PrintWriter out) {
          int n = in.nextInt();
  
          long cur = 2;
          HashSet<Long> set = new HashSet<>();
          set.add(1L);
          while (cur * cur <= n) {
              set.add(cur * cur);
              cur++;
          }
          cur = 2;
          while (cur * cur * cur <= n) {
              set.add(cur * cur * cur);
              cur++;
          }
          out.println(set.size());
      }
  
      public static void main(String[] args) throws Exception {
          try (FastIOAdapter ioAdapter = new FastIOAdapter()) {
              int count = 1;
              count = ioAdapter.nextInt();
              while (count-- > 0) {
                  solve(ioAdapter, ioAdapter.out);
              }
          }
      }
  
      static void ruffleSort(int[] arr) {
          int n = arr.length;
          Random rnd = new Random();
          for (int i = 0; i < n; ++i) {
              int tmp = arr[i];
              int randomPos = i + rnd.nextInt(n - i);
              arr[i] = arr[randomPos];
              arr[randomPos] = tmp;
          }
          Arrays.sort(arr);
      }
  
      static class FastIOAdapter implements AutoCloseable {
          BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
          public PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter((System.out))));
          StringTokenizer st = new StringTokenizer("");
  
          String next() {
              while (!st.hasMoreTokens())
                  try {
                      st = new StringTokenizer(br.readLine());
                  } catch (IOException e) {
                      e.printStackTrace();
                  }
              return st.nextToken();
          }
  
          String nextLine() {
              try {
                  return br.readLine();
              } catch (IOException e) {
                  e.printStackTrace();
                  return null;
              }
          }
  
          int nextInt() {
              return Integer.parseInt(next());
          }
  
          int[] readArray(int n) {
              int[] a = new int[n];
              for (int i = 0; i < n; i++) a[i] = nextInt();
              return a;
          }
  
          long[] readArrayLong(int n) {
              long[] a = new long[n];
              for (int i = 0; i < n; i++) a[i] = nextLong();
              return a;
          }
  
          long nextLong() {
              return Long.parseLong(next());
          }
  
          @Override
          public void close() throws Exception {
              out.flush();
              out.close();
              br.close();
          }
      }
  }
  