#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
const int maxn = 1e6 + 50;
const long long mod = 1e9 + 7;
int prime[150];
bool notprime[150];
int mu[150];
void getMobius(int N) {
  mu[1] = 1;
  int tot = 0;
  for (int i = 2; i <= N; i++) {
    if (!notprime[i]) {
      prime[++tot] = i;
      mu[i] = -1;
    }
    for (int j = 1; j <= tot; j++) {
      if (i * prime[j] > N) break;
      notprime[i * prime[j]] = true;
      if (i % prime[j] == 0) {
        mu[i * prime[j]] = 0;
        break;
      } else {
        mu[i * prime[j]] = -mu[i];
      }
    }
  }
}
long double ksm(long double a, long long b) {
  long double res = 1;
  while (b) {
    if (b & 1) res = res * a;
    a = a * a;
    b >>= 1;
  }
  return res;
}
long long get(long long x, long long i) {
  long long tmp = powl(x, 1.0 / i) + 2;
  while (ksm(tmp, i) > x) --tmp;
  return tmp;
}
int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);
  std::cout.tie(0);
  getMobius(120);
  int t;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    long long ans = n - 1;
    for (int i = 2; i <= 60; i++) {
      ans += mu[i] * (get(n, i) - 1);
    }
    cout << ans << endl;
  }
  return 0;
}
