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: /* package codechef; // don't place package name! */
  
  import java.util.*;
  import java.lang.*;
  import java.io.*;
  
  /* Name of the class has to be "Main" only if the class is public. */
  public class Codechef
  {
  	public static void main (String[] args) throws java.lang.Exception
  	{
  		// your code goes her
  	Scanner sc=new Scanner(System.in);
  	int t=sc.nextInt() ;
  	while(t>0){
  	t--;
  	long n=sc.nextLong();
  	
  //	int s=0;
  	long i=1;
  	int c=0;
  	Set<Long> s=new HashSet<>(); 
  	while(i*i*i<=n && i*i*i>0){
  	    c++;
  	    s.add((long)(i*i*i));
  	    i++;
  	 
  	}
  	
  	i=1;
  		while(i*i<=n&& i*i>0){
  	   // s++;
  	   	s.add((long)(i*i));
  	    i++;
  
  		    
  		}
  
  // 	int tem=0;
  // 	for(long j=4;j*j*j<=n;j+=2){
  	    
  // 	    if((j*(j/2) )*(j*(j/2))<=(long)n){
  // 	        c--;
  // 	    }
  	  
  // 	}
  	
  
  	System.out.println(s.size());
  	}
  	}}
  
  