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.*;
  import java.io.*;
  
  public class Main {
      static class FastReader {
          BufferedReader br;
          StringTokenizer st;
          public FastReader() {
              br = new BufferedReader(new InputStreamReader(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;
          }
      }
      static void sort(int a[]){ // int -> long
          ArrayList<Integer> arr=new ArrayList<>(); // Integer -> Long
          for(int i=0;i<a.length;i++)
              arr.add(a[i]);
          Collections.sort(arr);
          for(int i=0;i<a.length;i++)
              a[i]=arr.get(i);
  
      }
      private static long gcd(long a, long b){
          if(b==0)return a;
          return gcd(b,a%b);
      }
      private static long pow(long x,long y){
          if(y==0)return 1;
          long temp = pow(x, y/2);
          if(y%2==1){
              return x*temp*temp;
          }
          else{
              return temp*temp;
          }
      }
      static int log(long n){
          int res = 0;
          while(n>0){
              res++;
              n/=2;
          }
          return res;
      }
  
      static int mod = (int)1e9+7;
      static PrintWriter out;
      static FastReader sc ;
      public static void main(String[] args) throws IOException {
          sc = new FastReader();
          out = new PrintWriter(System.out);
          // primes();
          // ________________________________
  
          int test = sc.nextInt();
          StringBuilder output = new StringBuilder();
  
          while (test-- > 0) {
              long n = sc.nextLong();
  
              boolean[] ni = new boolean[1001];
  
              Arrays.fill(ni, false);
  
  
              for (int i = 1; i <= Math.cbrt(n); i++) {
                  long mi = (long)i*i*i;
                  double r = Math.sqrt(mi);
                  if (r != (int)r) {
                      ni[i] = true;
                  }
              }
  
              int c = (int)Math.sqrt(n);
  
              for (int i = 0; i < 1001; i++) {
                  if (ni[i]) {
                      c++;
                  }
              }
  
              System.out.println(c);
  
          }
  
          out.print(output);
          // _______________________________
  
          // int n = sc.nextInt();
          // out.println(solver());
          // ________________________________
          out.flush();
      }
  
      public static void solver(int[][] one, int n) {
  
  
  
  
  
  
  
  
  
  
      }
  }
  