#include <bits/stdc++.h>
using namespace std;
long long int chk(long long int n) {
  long long int s = sqrt(n);
  if (s * s == n)
    return 1;
  else
    return 0;
}
int main() {
  int t;
  cin >> t;
  vector<long long int> vec;
  long long int i, j;
  for (i = 0; i < t; i++) {
    long long int n;
    cin >> n;
    vec.push_back(n);
  }
  for (i = 0; i < t; i++) {
    long long int n = vec[i];
    long long int c = 0;
    c = sqrt(n);
    for (j = 2; j <= c; j++) {
      if (j * j * j <= n) {
        long long int q = chk(j * j * j);
        if (q == 0) c++;
      }
    }
    cout << c << endl;
  }
}

### Prompt

In cpp, your task is to solve 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;
long long int chk(long long int n) {
  long long int s = sqrt(n);
  if (s * s == n)
    return 1;
  else
    return 0;
}
int main() {
  int t;
  cin >> t;
  vector<long long int> vec;
  long long int i, j;
  for (i = 0; i < t; i++) {
    long long int n;
    cin >> n;
    vec.push_back(n);
  }
  for (i = 0; i < t; i++) {
    long long int n = vec[i];
    long long int c = 0;
    c = sqrt(n);
    for (j = 2; j <= c; j++) {
      if (j * j * j <= n) {
        long long int q = chk(j * j * j);
        if (q == 0) c++;
      }
    }
    cout << c << endl;
  }
}

```