#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
const int maxn = 1e3+5;
#define mst(a,b) memset(a,b,sizeof a)
#define ll long long
int main()
{
	int arr[maxn];
	for(int i=0;i<=maxn;++i)
	{
		arr[i]=1;
	}
	for(int i=2;i<=1001;++i){
		for(int j=2*i;j<=1001;j+=i){
			if(arr[i]==1) arr[j]=0;
		}
	}
	int num[maxn];
	for(int i=2;i<=1001;++i){
		int sum=0;
		for(int j=2;j<=i;++j){
			if(arr[j]) sum++;
		}
		num[i]=sum;
	}
	int t;
	cin>>t;
	while(t--)
	{
		int n;
		scanf("%d",&n);
		if(t!=0) printf("%d\n",num[n]);
		else 	printf("%d",num[n]);
	}
}