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.*;
  import java.math.*;
  
  public class SquareString {
      static final int MOD = (int) 1e9 + 7;
      static FastScanner fs = new FastScanner();
      static PrintWriter out = new PrintWriter(System.out);
  
      public static void main(String[] args) {
          int t = fs.nextInt();
          while (t-- > 0)
              solve();
          out.close();
      }
  
      private static void solve() {
          int n = fs.nextInt();
  
          int cnt =0;
          Set<Integer>st =new HashSet<>();
  
          for(int i =1;i*i<=n;i++)
              st.add(i*i);
  
          for(int i =1;i*i*i<=n;i++)
              if(!st.contains(i*i*i))st.add(i*i*i);
  
          out.println(st.size());
  
      }
  
      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[] readArray(int n) {
              int[] a = new int[n];
              for (int i = 0; i < n; i++) a[i] = nextInt();
              return a;
          }
  
          long[] readLongArray(int n) {
              long[] a = new long[n];
              for (int i = 0; i < n; i++) a[i] = nextLong();
              return a;
          }
  
          int nextInt() {
              return Integer.parseInt(next());
          }
  
          long nextLong() {
              return Long.parseLong(next());
          }
  
      }
  
  }
  