#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
//using mint = modint1000000007;
//using mint = modint998244353;

#define MAX_PRIME 1000000
bool isprime[MAX_PRIME+1];
vector<int> primes;
void init_prime(){
  fill(isprime, isprime+MAX_PRIME+1, true);
  isprime[0] = isprime[1] = false;
  for(int i = 2; i <= MAX_PRIME; i++) {
    if (isprime[i]) {
      primes.push_back(i);
      for(int j = i*2; j <= MAX_PRIME; j += i)
      isprime[j] = false;
    }
  }
}

int cnt[100005];

int main(){
  int T;
  cin >> T;

  init_prime();
  int sum = 0;
  rep(i,100005){
    if(isprime[i]) sum++;
    cnt[i] = sum;
  }
  
  rep(t,T){
    int N;
    cin >> N;

    cout << cnt[N] << endl;
  }
  
  return 0;
}