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;
  long long gcd(long long a, long long b) {
    if (b == 0) return a;
    return gcd(b, a % b);
  }
  long long power(long long x, unsigned long long y) {
    long long res = 1;
    while (y > 0) {
      if (y & 1) res = res * x;
      y = y >> 1;
      x = x * x;
    }
    return res;
  }
  long long one(long long x, long long y) {
    long long s = (x + 1) / power(2, y);
    if (s % 2 == 0) {
      return s / 2 * power(2, y);
    } else {
      return (s / 2 * power(2, y)) + ((x + 1) % power(2, y));
    }
  }
  signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    long long t;
    cin >> t;
    while (t--) {
      long long n;
      cin >> n;
      set<long long> s;
      long long x = sqrt(n);
      for (long long i = 1; i <= x; i++) {
        if (i * i <= n) {
          s.insert(i * i);
        }
        if (i * i * i <= n) {
          s.insert(i * i * i);
        }
      }
      cout << s.size() << endl;
    }
  }
  