#include <bits/stdc++.h>
using namespace std;
long long int mu[61];
void pre() {
  vector<bool> isPrime(1000, true);
  for (long long int i = 2; i < 60; i++) {
    if (isPrime[i]) {
      for (long long int j = i * i; j < 1000; j += i) isPrime[j] = false;
    }
  }
  mu[1] = 1;
  for (long long int i = 2; i < 60; i++) {
    int cnt = 0;
    for (long long int j = 2; j < 60; j++) {
      if (isPrime[j] && i % j == 0) {
        if (i % (j * j) == 0) {
          cnt = -1;
          break;
        } else
          cnt++;
      }
    }
    if (cnt == -1) {
      mu[i] = 0;
    } else {
      mu[i] = (cnt % 2 == 0 ? 1 : -1);
    }
  }
}
long long int expo(long long int x, long long int y) {
  long long int ans = 1;
  while (y > 0) {
    if ((long double)ans * (long double)x > 1e18) {
      return (long long int)1e18 + 1ll;
    }
    if (y & 1) ans *= x;
    if ((long double)x * (long double)x > 1e18 && y > 1) {
      return (long long int)1e18 + 1ll;
    }
    x *= x;
    y >>= 1;
  }
  return ans;
}
void solve() {
  long long int n;
  cin >> n;
  long long int ans = 0;
  long long int prev = n;
  for (long long int i = 1; i < 61; i += 1) {
    long long int l = 1, r = min(prev + 1, expo(10ll, (18 + i - 1) / i) + 1ll);
    while (l + 1 < r) {
      long long int mid = (l + r) / 2;
      if (expo(mid, i) > n) {
        r = mid;
      } else {
        l = mid;
      }
    }
    prev = l;
    ans += (l - 1) * mu[(long long int)i];
  }
  cout << ans << '\n';
}
int main() {
  expo(10, 18);
  std::ios::sync_with_stdio(false);
  cin.tie(0);
  cout.precision(10);
  cout << fixed;
  pre();
  int T = 1;
  cin >> T;
  while (T--) {
    solve();
  }
  return 0;
}
