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.OutputStream;
  import java.io.IOException;
  import java.io.InputStream;
  import java.io.PrintWriter;
  import java.util.*;
  import java.io.IOException;
  import java.io.BufferedReader;
  import java.io.InputStreamReader;
  import java.io.InputStream;
  
  public class Main {
  
      public static void main(String[] args) {
          InputStream inputStream = System.in;
          OutputStream outputStream = System.out;
          InputReader in = new InputReader(inputStream);
          PrintWriter out = new PrintWriter(outputStream);
          TaskA solver = new TaskA();
          int t;
          t = in.nextInt();
          //t = 1;
          while (t > 0) {
              solver.call(in,out);
              t--;
          }
          out.close();
      }
  
      static class TaskA {
          public void call(InputReader in, PrintWriter out) {
              long n = in.nextLong();
              Set<Long> set = new HashSet<>();
              long a = 1;
              while(true){
                  if(a*a > n){
                      break;
                  }
                  set.add(a*a);
                  a++;
              }
              a = 1;
              while(true){
                  if(a*a*a > n){
                      break;
                  }
                  set.add(a*a*a);
                  a++;
              }
              out.println(set.size());
  
          }
      }
  
      static int gcd(int a, int b)
      {
          if (a == 0)
              return b;
          return gcd(b % a, a);
      }
  
      static int lcm(int a, int b)
      {
          return (a / gcd(a, b)) * b;
      }
  
      static class answer implements Comparable<answer>{
          int a, b;
  
          public answer(int a, int b) {
              this.a = a;
              this.b = b;
          }
  
          @Override
          public int compareTo(answer o) {
              return o.a - this.a;
          }
      }
  
      static class arrayListClass {
          ArrayList<Integer> arrayList2 ;
  
          public arrayListClass(ArrayList<Integer> arrayList) {
              this.arrayList2 = arrayList;
          }
      }
  
      static long gcd(long a, long b)
      {
          if (b == 0)
              return a;
          return gcd(b, a % b);
      }
  
      static void sort(long[] a) {
          ArrayList<Long> l=new ArrayList<>();
          for (long i:a) l.add(i);
          Collections.sort(l);
          for (int i=0; i<a.length; i++) a[i]=l.get(i);
      }
  
      static final Random random=new Random();
  
      static void shuffleSort(int[] a) {
          int n=a.length;
          for (int i=0; i<n; i++) {
              int oi=random.nextInt(n), temp=a[oi];
              a[oi]=a[i]; a[i]=temp;
          }
          Arrays.sort(a);
      }
  
      static class InputReader {
          public BufferedReader reader;
          public StringTokenizer tokenizer;
  
          public InputReader(InputStream stream) {
              reader = new BufferedReader(new InputStreamReader(stream), 32768);
              tokenizer = null;
          }
  
          public String next() {
              while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                  try {
                      tokenizer = new StringTokenizer(reader.readLine());
                  } catch (IOException e) {
                      throw new RuntimeException(e);
                  }
              }
              return tokenizer.nextToken();
          }
  
          public int nextInt() {
              return Integer.parseInt(next());
          }
          public long nextLong(){
              return Long.parseLong(next());
          }
          public double nextDouble() {
              return Double.parseDouble(next());
          }
  
      }
  }