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.util.*;
  import java.io.*;
  
  public class B {
    public static void main(String[] args) throws Exception {
      BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
      PrintWriter pw = new PrintWriter(System.out);
      StringTokenizer st;
  
      int t = Integer.parseInt(br.readLine());
      for (int i = 0; i < t; i++) {
        int n = Integer.parseInt(br.readLine());
  
        Set<Double> nums = new HashSet<>();
  
        for (int j = 1; Math.pow(j, 2) <= n; j++) {
          nums.add(Math.pow(j, 2));
        }
  
        for (int j = 1; Math.pow(j, 3) <= n; j++) {
          nums.add(Math.pow(j, 3));
        }
  
        pw.println(nums.size());
  
      }
  
      pw.close();
    }
  }