#include <bits/stdc++.h>
using namespace std;
const unsigned int M = 1000000007;
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int t = 1;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    long long i, j, z;
    for (i = 2; i * i <= n; ++i) {
    }
    for (j = 2; j * j * j <= n; ++j) {
    }
    for (z = 2; z * z * z * z * z * z <= n; ++z) {
    }
    cout << i + j - z - 1 << endl;
  }
  return 0;
}

### Prompt

Please formulate a cpp solution to the following problem:

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

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
const unsigned int M = 1000000007;
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int t = 1;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    long long i, j, z;
    for (i = 2; i * i <= n; ++i) {
    }
    for (j = 2; j * j * j <= n; ++j) {
    }
    for (z = 2; z * z * z * z * z * z <= n; ++z) {
    }
    cout << i + j - z - 1 << endl;
  }
  return 0;
}

```