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 test {
      public static void main(String[] args) throws IOException {
          FastScanner fs=new FastScanner();
          PrintWriter out = new PrintWriter(System.out);
          int T = fs.nextInt();
          for (int tt=0; tt<T; tt++) {
              int n = fs.nextInt();
              int squares = (int) Math.pow(n, (double)(1.0/2.0));
              double cubes = Math.pow(n, (1.0/3.0));
              int c = (int)cubes;
              if ((c+1)*(c+1)*(c+1) == n) {
              	c++;
              }
              double sixes = Math.pow(n, (double)(1.0/6.0));
              int d = (int)sixes;
  
              if ((d+1)*(d+1)*(d+1)*(d+1)*(d+1)*(d+1) == n) {
              	d++;
              }
  
              // out.println(squares+" "+((c+1)*(c+1)*(c+1))+" "+((d+1)*(d+1)*(d+1)));
              out.println(squares+c-d);
          }
          out.close();
  
      }
  
      static final Random random=new Random();
  
      static void ruffleSort(int[] a) {
          int n=a.length;//shuffle, then sort
          for (int i=0; i<n; i++) {
              int oi=random.nextInt(n), temp=a[oi];
              a[oi]=a[i]; a[i]=temp;
          }
          Arrays.sort(a);
      }
  
      static class FastScanner {
          BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
          StringTokenizer st=new StringTokenizer("");
          String next() {
              while (!st.hasMoreTokens())
                  try {
                      st=new StringTokenizer(br.readLine());
                  } catch (IOException e) {
                      e.printStackTrace();
                  }
              return st.nextToken();
          }
  
          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 nextLong() {
              return Long.parseLong(next());
          }
      }
  
  }
  