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.*;
  
  
  public class divThree {
      public static void main(String[] args) throws IOException {
          BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
          int m = Integer.parseInt(br.readLine());
          
          for (int i = 0; i < m; i++) {
              int n = Integer.parseInt(br.readLine());
              int output = 0;
              if(n>1){
                  output+=cubes(1, n);
                  
              }
              else output = 1;
              System.out.println(output);
              
          }
      }
  
      public static int cubes(int a, int b){
          return (int)Math.sqrt(b) +
          (int)Math.cbrt(b) -
          (int)(Math.sqrt(Math.cbrt(b)));
      }
  
      public static int squares(int a, int b){
          return (int)(Math.floor(Math.sqrt(b)) - Math.ceil(Math.sqrt(a)) + 1);
      }
  
      public static triplet extended(int a, int b){
          if(b==0){
              triplet ans = new triplet();
              ans.x = a;
              ans.gcd = a;
              ans.y = 0;
              return ans;
          }
          triplet ans = new triplet();
          triplet smallAns = extended(b, a%b);
          ans.x = smallAns.y;
          ans.gcd = smallAns.gcd;
          ans.y = smallAns.x - (a/b)*smallAns.y;
  
          return ans;
      }
  }
  class triplet{
      int x, y, gcd;
      public triplet(){
  
      }
      public triplet(int x, int y, int gcd){
          this.x= x;
          this.y = y; 
          this.gcd = gcd;
      }
  }
  