#include <bits/stdc++.h>
using namespace std;
int q;
long long L, R;
vector<long long> vec, vec2;
long long solve(long long x);
set<int> st;
void precalc() {
  for (long long i = 2; i <= 1e6; i++) {
    for (long long j = i * i * i; j <= 1e18; j *= i) {
      vec.push_back(j);
      if (j > (1e18) / i) break;
    }
  }
  sort(vec.begin(), vec.end());
  vec.erase(unique(vec.begin(), vec.end()), vec.end());
  for (long long i = 0; i < (long long)vec.size(); i++) {
    long long tmp = solve(vec[i]);
    if (tmp * tmp == vec[i]) continue;
    vec2.push_back(vec[i]);
  }
  sort(vec2.begin(), vec2.end());
}
long long solve(long long x) {
  long long l = 0, r = 1e9 + 1;
  while (r - l > 1) {
    long long k = (l + r) / 2;
    if (k * k > x)
      r = k;
    else
      l = k;
  }
  return l;
}
int main() {
  cin >> q;
  precalc();
  while (q--) {
    scanf("%I64d", &R);
    printf("%I64d\n", R - (upper_bound(vec2.begin(), vec2.end(), R) -
                           vec2.begin() + solve(R)));
  }
  return 0;
}
