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 d1
  {
      public static void main(String[] args) throws Exception{
          BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
                  StringTokenizer st = new StringTokenizer(br.readLine());
                  int t = Integer.parseInt(st.nextToken());
                  outer : while(t-->0){
                      st = new StringTokenizer(br.readLine());
                      long n = Long.parseLong(st.nextToken());
                      int count = 0;
                      HashSet<Long> s1 = new HashSet<>();
                      HashSet<Long> s2 = new HashSet<>();
                      for(long i = 1;i*i<=n;i++){
                          s1.add(i*i);
                      }
                      for(long i = 1;i*i<=n/i;i++){
                          s2.add(i*i*i);
                      }
                      if(s1.size() >= s2.size()){
                          s1.removeAll(s2);
                          System.out.println(s1.size()+s2.size());
                      }
                      else{
                          s2.remove(s1);
                          System.out.println(s2.size()+s1.size());
                      }
                 }
              }
         public static long fastpow(long a,long b,long m){
             long res = 1L;
             while(b>0){
                 if(b%2 == 1L){
                     res = (res*a)%m;
                 }
                 b /= 2;
                 a = (a*a)%m;
             }
             return res;
         }
  }