2899

#include <stdio.h> 
#include <math.h>
#include <algorithm>
#define LL long long
#define GG int 
#define For(i, j, k) for(int i=j; i<=k; i++)
#define Dow(i, j, k) for(int i=j; i>=k; i--)
#define f(x) x*(x*(x*(x*8+7)+2)+3)+6-y
using namespace std;
const double eps = 1e-7; 
int cas;
double y;
double cal(double x) {
	return 6.0*pow(x,7.0)+8.0*pow(x,6.0)+7.0*pow(x,3.0)+5.0*pow(x,2.0)-y*x;
}
void solve() {
	double l=0.0, r=100.0, ret=1e13;
	while(l+eps<r) {
		double lm = l+(r-l)/3.0;
		double rm = l+(r-l)*2.0/3.0;
		double tmp = cal(lm), txp = cal(rm);
		if(tmp-txp < eps) r = rm,ret = min(tmp, ret);
		else l = lm, ret = min(ret, txp);
	}
	printf("%.4lf\n",ret);
}
int main() {
	scanf("%d",&cas);
	while(cas--) {
		scanf("%lf",&y); solve(); 
	}
	return 0; 
}