#include <bits/stdc++.h>
using namespace std;

using ll = long long;

// エラトステネスの篩(nは1以上, 素数列挙のみならi*i<=nで良い) O(nloglogn)
vector<bool> sieve(int n) {
  vector<bool> x(n + 1, true);
  x.at(0) = x.at(1) = false;
  for (int i = 2; i <= n; i++) {
    if (x.at(i)) {
      for (int j = 2 * i; j <= n; j += i) x.at(j) = false;
    }
  }
  return x;
}

int main() {
  int t;
  cin >> t;
  
  auto s = sieve(101000);
  vector<int> x(101000);
  for (int i = 2; i < 101000; i++) {
    if (s[i]) x[i] = 1;
    x[i] += x[i - 1];
  }
  
  while (t--) {
    int n;
    cin >> n;
    cout << x[n] << '\n';
  }
}