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;
  void err(istream_iterator<string> it) {}
  template <typename T, typename... Args>
  void err(istream_iterator<string> it, T a, Args... args) {
    cerr << *it << "=" << a << " ! ";
    err(++it, args...);
  }
  const long long N = 5e5 + 7, N1 = 25, inf = 2e18;
  const long double eps = 1e-8;
  const long long M = 1e9 + 7;
  long long x, i;
  int main() {
    long long tt;
    cin >> tt;
    set<long long> s;
    vector<long long> a;
    for (i = 1; i * i <= M; i++) s.insert(i * i);
    for (i = 1; i * i * i <= M; i++) s.insert(i * i * i);
    for (long long i : s) a.push_back(i);
    while (tt--) {
      cin >> x;
      x = upper_bound(a.begin(), a.end(), x) - a.begin();
      cout << x << "\n";
    }
  }
  