#include <stdbool.h>
#include <stdint.h>
#include <stdio.h>
#include <math.h>

typedef int64_t i64;
typedef uint64_t u64;

u64 prime_counting(u64 n) {
  if (n <= 1) return 0;
  if (n == 2) return 1;
  const int v = sqrtl(n);  
  int s = (v + 1) / 2;
  int smalls[s]; for (int i = 1; i < s; i++) smalls[i] = i;
  int roughs[s]; for (int i = 0; i < s; i++) roughs[i] = 2 * i + 1;
  i64 larges[s]; for (int i = 0; i < s; i++) larges[i] = (n / (2 * i + 1) - 1) / 2;
  bool skip[v + 1];
  #define DIVIDE(n, d) ((int)((double)(n)/d))
  #define HALF(n) (((n)-(1))>>(1))
  int pc = 0;
  for (int p = 3; p <= v; p += 2) if (!skip[p]) {
    int q = p * p;
    if ((i64)q * q > n) break;
    skip[p] = true;
    for (int i = q; i <= v; i += 2 * p) skip[i] = true;
    int ns = 0;
    for (int k = 0; k < s; k++) {
      int i = roughs[k];
      if (skip[i]) continue;
      i64 d = (i64)i * p;
      larges[ns] = larges[k] - (d <= v ? larges[smalls[d >> 1] - pc] : smalls[HALF(DIVIDE(n, d))]) + pc;
      roughs[ns++] = i;
    }
    s = ns;
    for (int i = HALF(v), j = ((v / p) - 1) | 1; j >= p; j -= 2) {
      int c = smalls[j >> 1] - pc;
      for (int e = (j * p) >> 1; i >= e; i--) smalls[i] -= c;
    }
    pc++;
  }
  larges[0] += (i64)(s + 2 * (pc - 1)) * (s - 1) / 2;
  for (int k = 1; k < s; k++) larges[0] -= larges[k];
  for (int l = 1; l < s; l++) {
    i64 q = roughs[l];
    i64 M = n / q;
    int e = smalls[HALF(M / q)] - pc;
    if (e < l + 1) break;
    i64 t = 0;
    for (int k = l + 1; k <= e; k++) t += smalls[HALF(DIVIDE(M, roughs[k]))];
    larges[0] += t - (i64)(e - l) * (pc + l - 1);
  }
  #undef DIVIDE
  #undef HALF
  return larges[0] + 1;
}

int main(void)
{
    int T;
    scanf("%d", &T);
    while (T--)
    {
        u64 X;
        scanf("%lu", &X);
        printf("%lu\n", prime_counting(X));
    }
    return 0;
}