#include <bits/stdc++.h>
using namespace std;
void doRoutine() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
}
const long long LOGN = 65;
const long long MAXN = 1000000000000000000;
long long max_sqrt[LOGN];
long long fpow(long long a, long long n) {
  if (n == 0) {
    return 1;
  } else if (n % 2 == 0) {
    return fpow(a * a, n / 2);
  } else {
    return fpow(a, n - 1) * a;
  }
}
long long get_root(long long n, long long i) {
  long long l = -1, r = max_sqrt[i] + 1;
  while (r - l > 1) {
    long long m = (l + r) / 2;
    if (fpow(m, i) <= n) {
      l = m;
    } else {
      r = m;
    }
  }
  return l;
}
long long solve(long long n) {
  long long logn = 65;
  vector<long long> dp(logn);
  vector<long long> root(logn);
  for (long long i = 1; i < logn; ++i) {
    root[i] = get_root(n, i);
  }
  for (long long i = logn - 1; i >= 0; --i) {
    if (root[i] >= 2) {
      long long sum = 0;
      for (long long x = 2; x < LOGN; ++x) {
        long long id = i * x;
        if (id < logn) {
          sum += dp[id];
        }
      }
      dp[i] = root[i] - 1 - sum;
    }
  }
  return dp[1];
}
signed main() {
  doRoutine();
  max_sqrt[1] = MAXN;
  max_sqrt[2] = 1000000000;
  for (long long i = 3; i < LOGN; ++i) {
    max_sqrt[i] = (long long)floor(pow((double)MAXN, 1. / (double)i));
  }
  long long t;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    cout << solve(n) << endl;
  }
  return 0;
}
