#include <bits/stdc++.h>
using namespace std;
void yes() { cout << "YES" << endl; }
void no() { cout << "NO" << endl; }
int main() {
  int t;
  cin >> t;
  while (t--) {
    long long int n;
    cin >> n;
    if (n == 1) {
      cout << 1 << endl;
      continue;
    }
    long long int ans = 0;
    long long int num = 2;
    unordered_map<long long int, long long int> saved;
    while (1) {
      long long int square = num * num;
      long long int cube = num * num * num;
      if (square > n) {
        break;
      }
      if (square == n) {
        if (saved[square] == 0) {
          saved[square] = 1;
          ans++;
        }
        break;
      }
      if (square < n) {
        if (saved[square] == 0) {
          saved[square] = 1;
          ans++;
        }
      }
      if (cube > n) {
        ;
      } else {
        if (cube <= n) {
          if (saved[cube] == 0) {
            saved[cube] = 1;
            ans++;
          }
        }
      }
      num++;
    }
    cout << ans + 1 << endl;
  }
  return 0;
}

### Prompt

Please provide a cpp coded solution to the problem described below:

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;
void yes() { cout << "YES" << endl; }
void no() { cout << "NO" << endl; }
int main() {
  int t;
  cin >> t;
  while (t--) {
    long long int n;
    cin >> n;
    if (n == 1) {
      cout << 1 << endl;
      continue;
    }
    long long int ans = 0;
    long long int num = 2;
    unordered_map<long long int, long long int> saved;
    while (1) {
      long long int square = num * num;
      long long int cube = num * num * num;
      if (square > n) {
        break;
      }
      if (square == n) {
        if (saved[square] == 0) {
          saved[square] = 1;
          ans++;
        }
        break;
      }
      if (square < n) {
        if (saved[square] == 0) {
          saved[square] = 1;
          ans++;
        }
      }
      if (cube > n) {
        ;
      } else {
        if (cube <= n) {
          if (saved[cube] == 0) {
            saved[cube] = 1;
            ans++;
          }
        }
      }
      num++;
    }
    cout << ans + 1 << endl;
  }
  return 0;
}

```