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.*;
   
  public class Contest_yandexA{
  	public static void main(String[] args) {
  		Scanner input = new Scanner(System.in);
  		int t = input.nextInt();
  		for(int tt = 0;tt<t;tt++){
  			int n = input.nextInt();
  			int ans = (int)Math.sqrt(n);
  			int c = (int)Math.round((double)Math.pow(n,1.0/3.0));
  			int x = (int)Math.round((double)Math.pow(n,1.0/6.0));
  			if(c*c*c > n){
  				c--;
  			}
  			if(x*x*x*x*x*x > n){
  				x--;
  			}
  			ans+= c-x;
  			System.out.println(ans);
  			
  		}
  	}
   
   
  	public static int gcd(int a,int b){
  		if(b == 0){
  			return a;
  		}
  		return gcd(b,a%b);
  	}
   
  	public static int lcm(int a,int b){
  		 return (a / gcd(a, b)) * b;
  	}
  }
  
  
  
  