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: // better space complexity than previous submission
  
  import java.util.*;
  import java.io.*;
  
  public class Main
  {
  	public static void main(String[] args) {
  		Scanner in = new Scanner(System.in);
  		int t = in.nextInt();
  		while(t-->0){
  		    long n = in.nextInt();
  		    long count = 0;
  		    for(long i=1; i*i<=n; i++){
  		        if(i*i*i <= n) count++;
  		        count++;
  		    }
  		    for(int i=1; Math.pow(i,6)<=n; i++){
  		        if(Math.pow(i,6) <= n) count--;
  		    }
  		    System.out.println(count);
  		}
  	}
  }
  