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.File;
  import java.io.FileInputStream;
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.io.PrintStream;
  import java.io.PrintWriter;
  import java.time.Duration;
  import java.time.Instant;
  import java.util.ArrayList;
  import java.util.Collections;
  import java.util.StringTokenizer;
  import java.util.TreeSet;
  
  import static java.lang.Math.min;
  import static java.lang.Math.max;
  import static java.lang.Math.abs;
  
  @SuppressWarnings("unused")
  public class B {
  	static boolean DEBUG = false;
  
  	public static void main(String[] args) throws IOException {
  		Instant start = Instant.now();
  		if (args.length == 2) {
  			System.setIn(new FileInputStream(new File("D:\\program\\javaCPEclipse\\CodeForces\\src\\input.txt")));
  			// System.setOut(new PrintStream(new File("output.txt")));
  			System.setErr(new PrintStream(new File("D:\\program\\javaCPEclipse\\CodeForces\\src\\error.txt")));
  			DEBUG = true;
  		}
  		Reader fs = new Reader();
  		PrintWriter pw = new PrintWriter(System.out);
  		int t = fs.nextInt();
  		TreeSet<Long> st = new TreeSet<Long>();
  		long i = 1;
  		st.add(i);
  		while (i <= 1e5) {
  			st.add(i * i);
  			st.add(i * i * i);
  			i++;
  		}
  //		pw.println(st.size());
  		ArrayList<Long> pre = new ArrayList<Long>();
  		st.forEach(pre::add);
  		while (t-- > 0) {
  			long n = fs.nextLong();
  			int ans2 = lower_bound(pre, n);
  			if (pre.get(ans2) != n) {
  				pw.println(ans2);
  			} else {
  				pw.println(ans2 + 1);
  			}
  		}
  		Instant end = Instant.now();
  		if (DEBUG) {
  			pw.println(Duration.between(start, end));
  		}
  		pw.close();
  	}
  
  	public static long __gcd(long a, long b) {
  		if (b != 0) {
  			return __gcd(b, a % b);
  		} else {
  			return a;
  		}
  	}
  
  	public static int lower_bound(ArrayList<Long> ar, long k) {
  		int s = 0;
  		int e = ar.size();
  		while (s != e) {
  			int mid = s + e >> 1;
  			if (ar.get(mid) < k) {
  				s = mid + 1;
  			} else {
  				e = mid;
  			}
  		}
  		if (s == ar.size()) {
  			return -1;
  		}
  		return s;
  	}
  
  	public static int upper_bound(ArrayList<Long> ar, Long k) {
  		int s = 0;
  		int e = ar.size();
  		while (s != e) {
  			int mid = s + e >> 1;
  			if (ar.get(mid) <= k) {
  				s = mid + 1;
  			} else {
  				e = mid;
  			}
  		}
  		if (s == ar.size()) {
  			return -1;
  		}
  		return s;
  	}
  
  	public static void print(long a, long b, long c, PrintWriter pw) {
  		pw.println(a + " " + b + " " + c);
  		return;
  	}
  
  	static class Reader {
  		BufferedReader br;
  		StringTokenizer st;
  
  		public Reader() {
  			br = new BufferedReader(new InputStreamReader(System.in));
  		}
  
  		String next() {
  			while (st == null || !st.hasMoreElements()) {
  				try {
  					st = new StringTokenizer(br.readLine());
  				} catch (IOException e) {
  					e.printStackTrace();
  				}
  			}
  			return st.nextToken();
  		}
  
  		int nextInt() {
  			return Integer.parseInt(next());
  		}
  
  		long nextLong() {
  			return Long.parseLong(next());
  		}
  
  		double nextDouble() {
  			return Double.parseDouble(next());
  		}
  
  		String nextLine() {
  			String str = "";
  			try {
  				str = br.readLine();
  			} catch (IOException e) {
  				e.printStackTrace();
  			}
  			return str;
  		}
  
  		int[] readArray(int n) {
  			int a[] = new int[n];
  			for (int i = 0; i < n; i++)
  				a[i] = nextInt();
  			return a;
  		}
  
  		int[][] read2Array(int n, int m) {
  			int a[][] = new int[n][m];
  			for (int i = 0; i < n; i++) {
  				for (int j = 0; j < m; j++) {
  					a[i][j] = nextInt();
  				}
  			}
  			return a;
  		}
  	}
  }