#include<bits/stdc++.h>
#define x first
#define y second
#define PB push_back
#define mst(x,a) memset(x,a,sizeof(x))
#define all(a) begin(a),end(a)
#define rep(x,l,u) for(ll x=l;x<u;x++)
#define rrep(x,l,u) for(ll x=l;x>=u;x--)
#define sz(x) x.size()
#define IOS ios::sync_with_stdio(false);cin.tie(0);
using namespace std;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef pair<long,long> PLL;
typedef pair<char,char> PCC;
typedef long long ll;
const int N=1e6+10;
const int M=1e6+10;
const int INF=0x3f3f3f3f;
const int MOD=1e9+7;
/*独立思考
不要看测试样例
找性质
试着证明
写完后不盲目交,检查*/
int ans[N],prime[N];
bool st[N];
void solve(){
int n;scanf("%d",&n);
printf("%d\n",ans[n]);
}
int main(){
//IOS;
//freopen("test.txt", "r", stdin);
//freopen("test.txt", "w", stdout);
int cnt=0;
rep(i,2,N+1){
if(!st[i]){
prime[cnt++]=i;
}
for(int j=0;prime[j]<=N/i;j++){
st[i*prime[j]]=true;
if(i%prime[j]==0) break;
}
}
ans[1]=1;
rep(i,2,N+1){
if(st[i]) continue;
ans[i]++;
if(i*i<=N) ans[i*i]--;
}
rep(i,1,N+1){
ans[i]+=ans[i-1];
}
int t;scanf("%d",&t);
while(t--)
solve();
return 0;
}