int primes[]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61};

ll g(ll p,ll m){
	ll x=pow(m,1./p);
	while(x<1d8&&(x+1)**p<=m){
		++x;
	}
	return x-1;
}

ll f(ll k){
	ll lo=0,hi=1d18;
	while(lo+1<hi){
		ll m=lo+hi>>1;
		ll c=1;
		rep[primes](p,18){
			c+=g(p,m);
		}
		if(c<k){
			lo=m;
		}else{
			hi=m;
		}
	}
	return hi;
}

{
	ll@t;
	rep(t){
		ll@k;
		wt(f(k));
	}
}