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 javax.sound.sampled.spi.FormatConversionProvider;
  import java.io.BufferedReader;
  import java.io.IOException;
  import java.io.InputStream;
  import java.io.InputStreamReader;
  import java.io.PrintWriter;
  
  import java.util.*;
  
  
  public class Main {
  
  
  
      public static void main(String[] args) throws IOException {
          Scanner in = new Scanner(System.in);
  
  
          try (PrintWriter or = new PrintWriter(System.out)) {
  
                  int t  =  in.nextInt();
                  outer:
                  while (t-->0){
  
  
                      int n=in.nextInt();
                      int ans= 1;
                      HashSet<Long>set = new HashSet<>();
  
                      for (int i = 1; i <=31624 ; i++) {
                          if ((long)i*i<=n)set.add((long)i*i);
                          if ((long)i*i*i<=n )set.add((long)i*i*i);
  
                          long num= (long)Math.sqrt((double) i*i);
                          if (num*num==i)set.add((long)i);
  
                      }
  
                      or.println(set.size());
  //                    or.println(Math.sqrt(1000000000.0));
  
  
  
  
                  }
  
  
  
          }
  
  
      }
  
  
      static long gcd(long a, long b) {
          if (b == 0)
              return a;
          return gcd(b, a % b);
      }
  
  
      static class Scanner {
  
          StringTokenizer st;
          BufferedReader br;
  
          public Scanner(InputStream s) {
              br = new BufferedReader(new InputStreamReader(s));
          }
  
          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 String nextLine() throws IOException {
              return br.readLine();
          }
  
          public double nextDouble() throws IOException {
              String x = next();
              StringBuilder sb = new StringBuilder("0");
              double res = 0, f = 1;
              boolean dec = false, neg = false;
              int start = 0;
              if (x.charAt(0) == '-') {
                  neg = true;
                  start++;
              }
              for (int i = start; i < x.length(); i++) {
                  if (x.charAt(i) == '.') {
                      res = Long.parseLong(sb.toString());
                      sb = new StringBuilder("0");
                      dec = true;
                  } else {
                      sb.append(x.charAt(i));
                      if (dec) {
                          f *= 10;
                      }
                  }
              }
              res += Long.parseLong(sb.toString()) / f;
              return res * (neg ? -1 : 1);
          }
  
          public boolean ready() throws IOException {
              return br.ready();
          }
  
      }
  }
  
  
  class Tempo {
  
      int first, second;
  
      public Tempo(int first, int second) {
          this.first = first;
          this.second = second;
      }
  }