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;
  vector<long long> v;
  long long mx = 1e9;
  void generate() {
    set<long long> s;
    long long x = 1;
    while (true) {
      if (x * x > mx) break;
      s.insert(x * x);
      x++;
    }
    x = 1;
    while (true) {
      if (x * x * x > mx) break;
      s.insert(x * x * x);
      x++;
    }
    for (long long i : s) v.push_back(i);
  }
  void solve() {
    long long n;
    cin >> n;
    cout << upper_bound(v.begin(), v.end(), n) - v.begin();
  }
  signed main() {
    generate();
    long long tt = 1;
    cin >> tt;
    while (tt--) {
      solve();
      cout << '\n';
    }
  }
  