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.io.*;
  public final class PROBOBAL {
      
      
  	public static void main(String[] args)throws IOException {
  	    
  		
  		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
  		int t=Integer.parseInt(br.readLine());
  		long a=0,n=0,j=0,l=0,c=0,c1=0;
  		double d=0;
  		
  		for(int i=1;i<=t;i++)
  		{
  			n=Long.parseLong(br.readLine());
  			c=(long)Math.cbrt(n);
  			c+=(long)Math.sqrt(n);
  			
  			l=(long)Math.sqrt(Math.cbrt(n));
  			c-=l;
  			System.out.println(c);
  		}
  	}
  }