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.io.BufferedReader;
  import java.io.InputStreamReader;
  import java.util.HashSet;
  import java.util.Set;
  import java.io.IOException;
  
  public class SquaresAndCubes{
  	
  	
  	public static void main(String[] args) throws IOException{
  		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
  		int t = Integer.parseInt(br.readLine());
  		while(t-- > 0) {
  			Set<Integer> values = new HashSet<Integer>();
  			int n = Integer.parseInt(br.readLine());
  			for(int i = 1; i * i <= n; i++) {
  				values.add(i * i);
  			}
  			
  			for(int i = 1; i * i * i<= n; i++) {
  				values.add(i * i * i);
  			}
  			
  			System.out.println(values.size());
  			
  		}
  	}
  }
  