#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100000;
const long long INF = 1e18;
long long mul(long long a, long long b) {
  if (b == 0) return 0;
  if (a > INF / b) return INF + 9487;
  return a * b;
}
long long qpow(long long a, long long p) {
  long long res = 1;
  while (p) {
    if (p & 1) res = mul(res, a);
    a = mul(a, a);
    p >>= 1;
  }
  return res;
}
bool I_am_not_a_square_number(long long x) {
  long long sq = sqrt(x);
  for (int i = -1; i <= 1; i++)
    if ((sq + i) * (sq + i) == x) return false;
  return true;
}
vector<long long> never_elegant;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  for (long long i = 2; i <= 1000000; i++) {
    long long tmp = i * i * i;
    while (tmp <= INF) {
      if (I_am_not_a_square_number(tmp)) {
        never_elegant.push_back(tmp);
      }
      tmp = mul(tmp, i);
    }
  }
  sort(never_elegant.begin(), never_elegant.end());
  never_elegant.resize(unique(never_elegant.begin(), never_elegant.end()) -
                       never_elegant.begin());
  int T;
  cin >> T;
  while (T--) {
    long long n, sq;
    cin >> n;
    sq = sqrt(n);
    for (long long i = max(0LL, sq - 3);; i++) {
      if (i * i > n) {
        sq = i - 1;
        break;
      }
    }
    long long ans = max(0LL, sq - 1) + (upper_bound(never_elegant.begin(),
                                                    never_elegant.end(), n) -
                                        never_elegant.begin());
    cout << n - 1 - ans << "\n";
  }
}
