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.IOException;
  import java.io.InputStreamReader;
  
  public class Q2202122021 {
  	
  	static int SquareCube(long N)
      {
       
          int cnt = 0, i = 1;
       
          while ((int)(Math.pow(i, 6)) <= N) {
              ++cnt;
              ++i;
          }
       
          return cnt;
      }
  	public static void main(String[] args) throws Exception {
  		
  		BufferedReader sc = new BufferedReader(new InputStreamReader(System.in));
  		int test=Integer.parseInt(sc.readLine());
  		while(test>0) {
  			
  			long N=Long.parseLong(sc.readLine());
  			long count;
  			if(N<4)
  			{
  				System.out.println(1);
  			}
  			else
  			{
  				long sq=(long) Math.floor(Math.sqrt(N));
  				long cube=(long) Math.floor( (Math.cbrt(N)) );
  				count=sq+cube-SquareCube(N);
  				System.out.println(count);
  				
  			}
  			test--;
  		}
  	}
  
  }
  