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.io.PrintWriter;
  import java.util.ArrayList;
  import java.util.HashSet;
  import java.util.List;
  import java.util.Set;
  import java.util.StringTokenizer;
  
  public class ProblemB {
  	public static void solution() {
  		//TODO
  	}
  	
  	public static void main(String[] args) throws Exception {
  		BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
  		PrintWriter writer = new PrintWriter(System.out);
  		
  		int tt = Integer.parseInt(reader.readLine()); // One number per line
  		
  		for (int t = 0; t < tt; t++) {
  			//StringTokenizer info = new StringTokenizer(reader.readLine()); // Multiple numbers per line
  			int n = Integer.parseInt(reader.readLine()); // For next number
  			int a = 1;
  			int count = 0;
  			Set<Integer> set = new HashSet<>();
  			while (Math.pow(a, 2) <= n) {
  				if (!set.contains((int) Math.pow(a, 2))) {
  					count++;
  					set.add((int) Math.pow(a, 2));
  				}
  				a++;
  				if (Math.pow(a, 3) <= n) {
  					count++;
  					set.add((int) Math.pow(a, 3));
  				}
  			}
  			writer.println(count);
  			
  		}
  		
  		
  		reader.close();
  		writer.close();
  	}
  		
  }
  