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.HashSet;
  import java.util.StringTokenizer;
  
  public class Main {
  
      static Scanner sc;
      static PrintWriter pw;
  
      public static void main(String[] args) throws IOException {
          sc = new Scanner(System.in);
          pw = new PrintWriter(System.out);
          solve();
          pw.close();
      }
  
      public static void solve() throws IOException {
          long l = sc.nextInt();
          for (int i = 0; i < l; i++) {
              int sum = 0;
              long n = sc.nextInt();
              HashSet hs = new HashSet<Integer>();
              for (long j = 1;j*j<=n;j++) {
                  if(j*j <= n && !hs.contains(j*j)){
                      sum+=1;
                      hs.add(j*j);
                  }
                  if (j*j*j <= n && !hs.contains(j*j*j)){
                      sum+=1;
                      hs.add(j*j*j);
                  }
              }
              pw.println(sum);
          }
  
      }
  
  
      static class Scanner {
          BufferedReader br;
          StringTokenizer st;
  
          public Scanner(InputStream s) {
              br = new BufferedReader(new InputStreamReader(s));
          }
  
          public Scanner(FileReader f) {
              br = new BufferedReader(f);
          }
  
          public String next() throws IOException {
              while (st == null || !st.hasMoreTokens())
                  st = new StringTokenizer(br.readLine());
              return st.nextToken();
          }
  
          public int nextInt() throws IOException {
              return Integer.parseInt(next());
          }
  
          public long nextLong() throws IOException {
              return Long.parseLong(next());
          }
  
          public double nextDouble() throws IOException {
              return Double.parseDouble(next());
          }
  
          public int[] nextIntArr(int n) throws IOException {
              int[] arr = new int[n];
              for (int i = 0; i < n; i++) {
                  arr[i] = Integer.parseInt(next());
              }
              return arr;
          }
  
      }
  }
  