#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<string>
#include<cmath>
using namespace std;
const int maxn = 100010;
const int inf = 0x3f3f3f3f;
int n,m,k,t;
int a[maxn];
string s;
int check(int x){
	for(int i=2;i*i<=x;i++){
		if(x%i==0) return 0;
	}
	return 1;
}
int main(){
	for(int i=2;i<=1000;i++){
		if(check(i)) a[i]=a[i-1]+1;
		else a[i]=a[i-1];
	}
    scanf("%d",&t);
    for(int i=0;i<t;i++){
    	scanf("%d",&n);
    	printf("%d\n",a[n]);
	}
}