#include<cstdio>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<set>
#include<map>
#include<queue>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn=1010;
const int inf =0x3f3f3f3f;
int n,m,k,t;
int a[maxn];
char ch[maxn];
void prime()
{
	
	for(int i=2;i<=1000;++i)
	{
		if(a[i])continue;
		for(int j=i;j<=1000/i;j++)a[i*j]=1;
	}
}
int main()
{
	for(int i=1;i<=maxn;++i)
		a[i]=0;
	prime();
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d",&n);
		int ans=0;
		for(int i=2;i<=n;++i)
			if(a[i]==0)++ans;
		printf("%d\n",ans);
	}
}