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;
  const long long MOD = 1e9 + 7;
  int tx[] = {-1, 0, 1, 0};
  int ty[] = {0, 1, 0, -1};
  void Madaa() {
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
  }
  int main() {
    cout << fixed << setprecision(0);
    ;
    Madaa();
    long long t = 1;
    cin >> t;
    while (t--) {
      long long n;
      cin >> n;
      cout << ((long long)sqrt(n + .3L) + (long long)cbrt(n + .3L)) -
                  (long long)pow(n + .3L, 1.0L / 6)
           << "\n";
    }
  }
  