#include <bits/stdc++.h>
using namespace std;
const long long INF = (1ll << 63) - 1;
long long n;
int miu[64], v[64];
void init() {
  for (int i = 1; i < 64; i++) {
    miu[i] = 1;
    v[i] = 0;
  }
  for (int i = 2; i < 64; i++) {
    if (v[i]) continue;
    miu[i] = -1;
    for (int j = 2 * i; j < 64; j += i) {
      v[j] = 1;
      if ((j / i) % i == 0)
        miu[j] = 0;
      else
        miu[j] *= -1;
    }
  }
}
long long llpow(long long a, long long k) {
  long long res = 1;
  while (k) {
    if (a > n) return INF;
    if (k & 1) res = res * a;
    if (res > n) return INF;
    a = a * a;
    k /= 2;
  }
  return res;
}
long long get(long long n, long long k) {
  long long t = powl(n, 1. / k) - 0.5;
  return t + (powl(t + 1, k) - 0.5 <= n);
}
int main() {
  ios::sync_with_stdio(0);
  int T;
  cin >> T;
  init();
  while (T--) {
    cin >> n;
    long long ans = 0;
    for (int i = 1; i <= 62; i++) {
      if (miu[i] == 0) continue;
      ans += miu[i] * (get(n, i) - 1);
    }
    cout << ans << endl;
  }
  return 0;
}
