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: #include <bits/stdc++.h>
  using namespace std;
  mt19937 ran(time(0));
  long long mod = 1e9 + 7;
  long long gcd(long long a, long long b) {
    if (!b) return a;
    return gcd(b, a % b);
  }
  long long Bpow(long long a, long long b) {
    long long ans = 1;
    while (b) {
      if (b & 1) {
        ans *= a;
        ans %= mod;
      }
      a = a * a % mod;
      b >>= 1;
    }
    return ans;
  }
  int32_t main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    long long t;
    cin >> t;
    while (t--) {
      long long n;
      cin >> n;
      long long ans = 0;
      map<long long, long long> used;
      for (long long i = 1; i * i <= n; i++) {
        if (i * i * i <= n) {
          ++ans;
          used[i * i * i]++;
        }
        if (!used[i * i]) ++ans;
      }
      cout << ans << "\n";
    }
  }
  