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 Codechef
  {
  	public static void main (String[] args) throws java.lang.Exception
  	{
  		Scanner sc=new Scanner(System.in);
  		
  		int tc=sc.nextInt();
  		while(tc-->0) {
  			// Strings=sc.next();
  			// int n=s.length();
  			
  			int n=sc.nextInt();
  			// int a=new int[n];
  			
  			/*for(int i=0;i<n;i++) {
  				a[i]=sc.nextInt();
  			}*/
  			
  			int squares=getRoot(n,2),
  			cubes=getRoot(n,3),
  			sixths=getRoot(n,6);
  			
  			System.out.println(squares + cubes - sixths);
  			
  			// System.out.println(squares +" "+ cubes +" "+ sixths);
  		}
  	}
  	static int getRoot(int n,int r) {
  	    int root=(int)Math.pow(n,1.0/r);
  	    if(Math.pow(root+1,r)>n) {
  	        return root;
  	    } else {
  	        return root+1;
  	    }
  	}
  }