#include using namespace std; using ll=long long; /* 1e-1->s(26)=5.09901951359278483002 1e-2->2s(2)+3s(13)+5s(15)=33.009997682175242402857368 1e-3->3s(2)+s(11)+4s(83)=44.00099979405188052330 1e-4->5s(2)+3s(11)+5s(23)=41.0000997994952 1e-5->s(2)+s(15)+16s(3)=33.00000982968254863 1e-6->5s(18)+4s(26)+2s(94)=61.0000009196328 1e-7->??? */ const double lim[5]={0,1e-5,1e-6,1e-8,1.1e-10}; int q; double x; vector> v[5]; vector ns[5]; mt19937 mt(time(0)); int rd(int lim){ return mt()%lim+1; } bool ch(){ for(int i=1;i<5;++i){ v[i].clear(); ns[i].clear(); } while(v[1].size()<100){ const int lm=x/8*x/8; int no=rd(lm); int ts=(x/8-sqrt(no))*(x/8-sqrt(no)); double sum=sqrt(no)+sqrt(ts); if(fabs(sum-x/8)0; } int main(){ //freopen("squareroot.in","r",stdin); //freopen("squareroot.out","w",stdout); cin>>q; while(q--){ cin>>x; while(!ch()); cout<