#include <bits/stdc++.h>
using namespace std;
inline long long intpow(long long x, int p, long long bnd) {
  long long res = 1;
  while (p) {
    if (p & 1) {
      if (res > bnd / x) return -1;
      res *= x;
    }
    if (p > 1) {
      if (x > bnd / x) return -1;
      x *= x;
    }
    p >>= 1;
  }
  return res;
}
inline long long binsearch_root(int pw, long long bnd) {
  long long L = 1, R = (long long)1e9 + 2;
  while (R - L > 1) {
    long long mid = (L + R) / 2;
    if (intpow(mid, pw, bnd) == -1)
      R = mid;
    else
      L = mid;
  }
  return L;
}
int mu[100];
long long maxpow[64];
long long solve(long long n) {
  unsigned long long ans = 0;
  for (int pw = 2; pw <= 59; pw++) {
    long long maxnum;
    if (pw > 2) {
      while (intpow(maxpow[pw], pw, n) == -1) --maxpow[pw];
      maxnum = maxpow[pw];
    } else {
      maxnum = binsearch_root(2, n);
    }
    ans += mu[pw] * (maxnum - 1);
  }
  return (long long)(n - 1 - ans);
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  for (int i = 2; i <= 59; i++) {
    int j = i;
    mu[i] = -1;
    for (int d = 2; d <= j; d++) {
      if (j % d == 0) {
        mu[i] *= -1;
        j /= d;
        if (j % d == 0) {
          mu[i] = 0;
          break;
        }
      }
    }
  }
  for (int pw = 3; pw <= 59; pw++)
    maxpow[pw] = binsearch_root(pw, (long long)1e18);
  int T;
  scanf("%d", &T);
  vector<pair<long long, int> > avtor_zadachi_pidoras;
  for (int i = 0; i < T; i++) {
    long long n;
    scanf("%lld", &n);
    avtor_zadachi_pidoras.push_back(make_pair(n, i));
  }
  sort((avtor_zadachi_pidoras).begin(), (avtor_zadachi_pidoras).end());
  reverse((avtor_zadachi_pidoras).begin(), (avtor_zadachi_pidoras).end());
  vector<long long> ans(T);
  for (auto query : avtor_zadachi_pidoras) {
    ans[query.second] = solve(query.first);
  }
  for (int i = 0; i < T; i++) printf("%lld\n", ans[i]);
  return 0;
}
