/*
author : Gemini
date : September 6th, 2022
url : https://vjudge.net/contest/512482#problem/I
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=316305;
template<typename T>
void read(T &x){
	T sgn=1;
	char ch=getchar();
	for(;!isdigit(ch);ch=getchar())if(ch=='-')sgn=-1;
	for(x=0;isdigit(ch);ch=getchar())x=x*10+ch-'0';
	x*=sgn;
}
ll g[maxn<<1],a[maxn<<1];
int sq,tot,cnt;
ll F(ll n){
	cnt=tot=0;
	sq=sqrt(n);
	for(ll i=1;i<=n;i=a[tot]+1){
		a[++tot]=n/(n/i);
		g[tot]=a[tot]-1;
	}
	auto id=[n](ll x){
		return x<=sq?x:tot-n/x+1; 
	};
	for(int i=2;i<=sq;i++){
		if(g[i]!=g[i-1]){
			cnt++;
			for(int j=tot;a[j]>=1ll*i*i;j--){
				g[j]-=g[id(a[j]/i)]-cnt+1;
			}
		}
	}
	return g[tot];
}
int main(){
	int T;
	read(T);
	while(T--){
		ll n;
		read(n);
		if(n==1){
			puts("1");
		}else if(n==2){
			puts("2");
		}else{
			ll num=F(n)-F(n/2)+1;
			printf("%lld\n",(n-num+1)/2+num);
		}
	}
	return 0;
}