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.*;
  import java.util.*;
  
  public class B {
  	
  	public static void main(String[] args)throws IOException {
  		
  		FastScanner scan = new FastScanner();
  		PrintWriter output = new PrintWriter(System.out);
  		int t = scan.nextInt();
  		HashSet<Long> set = new HashSet<>();
  		for(long i = 1;i<=31630;i++) {
  			set.add(i*i);
  		}
  		
  		for(long i = 1;i<=1005;i++) {
  			set.add(i*i*i);
  		}
  		
  		ArrayList<Long> list = new ArrayList<>();
  		list.addAll(set);
  		Collections.sort(list);
  		
  		for(int tt = 0;tt<t;tt++) {
  			int count = 0;
  			long n = scan.nextLong();
  			for(long i : list) {
  				if(i<=n) count++;
  				else break;
  			}
  			output.println(count);
  		}
  		output.flush();
  	}
  	
  	public static int[] sort(int arr[]) {
  		List<Integer> list = new ArrayList<>();
  		for(int i:arr) list.add(i);
  		Collections.sort(list);
  		for(int i = 0;i<list.size();i++) arr[i] = list.get(i);
  		return arr;
  	}
  	
  	public static int gcd(int a, int b) {
  		if(a == 0) return b;
  		return gcd(b%a, a);
  	}
  	
  	public static void printArray(int arr[]) {
  		for(int i:arr) System.out.print(i+" ");
  		System.out.println();
  	}
  	
  	static class FastScanner {
  		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
  		StringTokenizer st=new StringTokenizer("");
  		String next() {
  			while (!st.hasMoreTokens())
  				try {
  					st=new StringTokenizer(br.readLine());
  				} catch (IOException e) {
  					e.printStackTrace();
  				}
  			return st.nextToken();
  		}
  
  		int nextInt() {
  			return Integer.parseInt(next());
  		}
  		int[] readArray(int n) {
  			int[] a=new int[n];
  			for (int i=0; i<n; i++) a[i]=nextInt();
  			return a;
  		}
  		long nextLong() {
  			return Long.parseLong(next());
  		}
  		
  		double nextDouble() {
  			return Double.parseDouble(next());
  		}
  	}
  
  }
  