#include <bits/stdc++.h>
int main() {
  int a;
  scanf("%d", &a);
  int A[a];
  for (int i = 0; i < a; ++i) {
    scanf("%d", &A[i]);
  }
  for (int i = 0; i < a; ++i) {
    int l, m;
    int K = 0;
    l = (int)(sqrtl(A[i]));
    m = (int)(cbrtl(A[i]));
    int z = 0;
    z = (int)cbrtl(sqrtl(A[i]));
    K = (l + m - z);
    printf("%d\n", K);
  }
  return 0;
}

### Prompt

Please create a solution in CPP 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>
int main() {
  int a;
  scanf("%d", &a);
  int A[a];
  for (int i = 0; i < a; ++i) {
    scanf("%d", &A[i]);
  }
  for (int i = 0; i < a; ++i) {
    int l, m;
    int K = 0;
    l = (int)(sqrtl(A[i]));
    m = (int)(cbrtl(A[i]));
    int z = 0;
    z = (int)cbrtl(sqrtl(A[i]));
    K = (l + m - z);
    printf("%d\n", K);
  }
  return 0;
}

```