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.lang.*;
  import java.io.*;
  
  public class Practice2 {
      static class FastReader {
          BufferedReader br;
          StringTokenizer st;
   
          public FastReader() {
              br = new BufferedReader(new InputStreamReader(System.in));
          }
   
          String next() {
              while (st == null || !st.hasMoreElements()) {
                  try {
                      st = new StringTokenizer(br.readLine());
                  } catch (IOException e) {
                      e.printStackTrace();
                  }
              }
              return st.nextToken();
          }
   
          int nextInt() {
              return Integer.parseInt(next());
          }
   
          long nextLong() {
              return Long.parseLong(next());
          }
   
          double nextDouble() {
              return Double.parseDouble(next());
          }
   
          String nextLine() {
              String str = "";
              try {
                  str = br.readLine();
              } catch (IOException e) {
                  e.printStackTrace();
              }
              return str;
          }
      }
  //////////////////////////////Input///////////////////////////////
  static void Input(){
   
     try {
      FileOutputStream output=new FileOutputStream("output2.txt");
      PrintStream out=new PrintStream(output);
      //Diverting the output stream into file "temp.out".Comment the below line to use console
      System.setOut(out);
      
      InputStream input=new FileInputStream("input.txt");
      //Diverting the input stream into file "temp.in".Comment the below line to use console
      System.setIn(input);
      
     } catch (FileNotFoundException e) {
      e.printStackTrace();
     }
  }
  //////////////////////////////////////////////////////////////////
  static class Node{
      Node arr[];
      int data;
      Node(int n,int data){
          arr=new Node[n];
          this.data=data;
      }
  }
  static void inorder(Node node){
      if(node==null){
          return;
      }
      int c=node.arr.length;
      for(int i=0;i<c-1;i++){
          inorder(node.arr[i]);
      }
      System.out.println(node.data);
      inorder(node.arr[c-1]);
  }
  static void rootToNode(Node root,Node x){
      
  }
  static void LCA(Node root,Node a,Node b){
  
  }
      static long findArea(double a, double b, double c)
      {
          // Length of sides must be positive and sum of any two sides
          // must be smaller than third side.
          if (a < 0 || b < 0 || c <0 || (a+b <= c) ||
              a+c <=b || b+c <=a)
          {
              System.out.println("Not a valid triangle");
          }
          double s = (a+b+c)/2;
          double ans=(double)Math.sqrt(s*(s-a)*(s-b)*(s-c))*2;
          //System.out.println(ans);
          ans=Math.round((ans * 100.00) / 100.00);
          return (long)Math.ceil(ans);
      }
      static double distance(long x1, long y1, long x2, long y2)
  {
      // Calculating distance
      return Math.sqrt(Math.pow(x2 - x1, 2) +
                  Math.pow(y2 - y1, 2) * 1.00);
  }
  //////////////////////////////////////////////////////////////////
  public static void main(String[] args) {
      //Input();    
      FastReader sc = new FastReader();
      int t=sc.nextInt();
  
      for(int test=0;test<t;test++){
        long n=sc.nextLong();
        HashMap<Long, Integer> map = new HashMap<>();
        long inc=1;
        long ans=0;
        while(inc*inc<=n){
          if(map.get(inc*inc)==null){
              ++ans;
              map.put(inc*inc,1);
          }
          if(inc*inc*inc <= n){
          if(map.get(inc*inc*inc)==null){
              ++ans;
              map.put(inc*inc*inc,1);
          }            
          }
          ++inc;
        }
        System.out.println(ans);
  }
  }    
  }