#include <cstdio>
#include <algorithm>
#include <iostream>
#include<cstring>
#include<cmath>
using namespace std;
const int maxn=10005;
int a[1005],k,i,n,sum;
int f(int a) 
{ 
	int flag=1;
	int b=pow(a,0.5);
	for(int i=2;i<=b;i++)
	{
		if(a%i==0)flag=0;
	}
	return flag;
}
int main()
{
	for(i=2;i<=1000;i++)
	{
		a[i]=0;
	}
	for(i=2;i<=1000;i++)
	{
			a[i]=a[i-1]+f(i);
	}
	long long t;
	scanf("%lld",&t);
	while(t--)
	{
		sum=0;
		scanf("%d",&n);
		printf("%d\n",a[n]);
	}

}