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 B {
      static MyScanner sc;
      static PrintWriter out;
      static {
          sc = new MyScanner();
          out = new PrintWriter(System.out);
      }
      public static void solve() {
          double n = sc.nextInt() + 0.5;
          int a = (int)Math.pow(n, 0.5);
          int b = (int)Math.pow(n, 1 / 3d);
          int c = (int)Math.pow(n, 1 / 6d);
          out.println(a + b - c);
      }
      public static void main(String[] args) {
          int t = sc.nextInt();
          while(t-- > 0)
              solve();
          out.flush();
      }
  }
  
  class MyScanner {
      BufferedReader br;
      StringTokenizer tok;
      MyScanner() {
          try { br = new BufferedReader(new InputStreamReader(System.in)); }
          catch(Exception e) { System.out.println(e); }
          tok = new StringTokenizer("");
      }
      public String next() {
          try {
              while(!tok.hasMoreTokens()) tok = new StringTokenizer(br.readLine());
          }
          catch(Exception e) { System.out.println(e); }
          return tok.nextToken();
      }
      public int nextInt() {
          return Integer.parseInt(next());
      }
      public long nextLong() {
          return Long.parseLong(next());
      }
      public double nextDouble() {
          return Double.parseDouble(next());
      }
  }
  