#include <bits/stdc++.h>
const int D = 61, C = 100001, CC = 1000001;
int f[D], end[D];
long long dp[D][C], d3[CC];
inline long long poww(long long a, long long b) {
  if (b == 0) return 1;
  long long c = 1;
  while (b > 0) {
    if (b % 2 == 1) c = c * a;
    b /= 2;
    a = a * a;
  }
  return c;
}
inline int binlow(long long tab[], long long v, int l, int r) {
  int m;
  while (l <= r) {
    m = (l + r) / 2;
    if (tab[m] > v)
      r = m - 1;
    else
      l = m + 1;
  }
  return r;
}
inline long long bin2(long long v, long long l, long long r) {
  long long m;
  while (l <= r) {
    m = (l + r) / 2;
    if (m * m > v)
      r = m - 1;
    else
      l = m + 1;
  }
  return r;
}
int main() {
  int i, j, q;
  long long a, b, wynn = 0, z;
  double x, y, c;
  for (i = 2; i < D; i++) {
    if (f[i] == 0) {
      f[i] = 1;
      for (j = i + i; j < D; j += i)
        if (f[j] != -2) f[j]++;
      for (j = i * i; j < D; j += (i * i)) f[j] = -2;
    }
  }
  for (i = 2; i < D; i++) {
    if (f[i] == -2)
      f[i] = 0;
    else if (f[i] % 2 == 0)
      f[i] = -1;
    else
      f[i] = 1;
  }
  for (j = 0; j < CC; j++) {
    z = poww(j, 3);
    d3[j] = z;
  }
  end[3] = j - 1;
  for (i = 5; i < D; i++) {
    if (f[i] == 0) continue;
    for (j = 0; j < C; j++) {
      z = poww(j, i);
      if (log10(j) * i > 18.6) break;
      dp[i][j] = z;
    }
    end[i] = j - 1;
  }
  scanf("%d", &q);
  while (q--) {
    scanf("%lld", &a);
    wynn = bin2(a, 0, 1000000000) - 1;
    b = binlow(d3, a, 0, end[3]);
    wynn = wynn + (b - 1);
    for (i = 5; i < 61; i++) {
      if (f[i] == 0) continue;
      b = binlow(dp[i], a, 0, end[i]);
      wynn = wynn + (b - 1) * f[i];
    }
    printf("%lld\n", a - wynn - 1);
  }
  return 0;
}
