#include #pragma GCC optimize("Ofast") #define _GLIBCXX_DEBUG using namespace std; using std::cout; using std::cin; using std::endl; using ll=long long; using ld=long double; ll ILL=1167167167167167167; const int INF=2100000000; ll mod=1e9+7; #define rep(i,a) for (ll i=0;i using _pq = priority_queue, greater>; template ll LB(vector &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();} template ll UB(vector &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();} template bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;} template bool chmax(T &a,const T &b){if(a void So(vector &v) {sort(v.begin(),v.end());} template void Sore(vector &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});} void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";} //a以下の素数を列挙、計算量:Nlog(log(N)) vector Eratosthenes(long long a){ if(a<2) return {}; vector p(a+1),ans; p[0]=1,p[1]=1; long long k=2; while(k*k<=a){ if(p[k]==0){ ans.push_back(k); for(long long i=2;i*k<=a;i++){ p[i*k]=1; } } k++; } while(k<=a){ if(p[k]==0) ans.push_back(k); k++; } return ans; } // rainy ~ 雨に打たれて ~ int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int M=62; auto base=Eratosthenes(M); vector p(M,-1); for(auto x:base){ p[x]=1; for(int i=x*2;i>T; rep(roop,T){ int K; cin>>K; ll l=0,r=ILL; while(r-l>1){ ll d=(r+l)/2; ll tmp=0; for(int i=2;i1){ ll D=(R+L)/2; ll N=d; rep(k,i){ N/=D; if(N==0) break; } if(N==0) R=D; else L=D; } tmp+=p[i]*(L-1); } tmp++; if(tmp