#include <iostream>
#include <algorithm>
#include <iomanip>
using namespace std;

double memo[1000010], p[7];
double E[7]={
    1, 1.0000000000000000, 1.0833333333333333, 1.2569444444444444,
    1.5353009259259260, 1.6915991512345676, 2.0513639724794235
};
double f(int x, int k)
{
    if (x>=k) return 0;
    double& res=memo[x];
    if (res>0) return res;
    res=1;
    for(int i=1;i<=6;++i) res+=f(x+i, k)*p[i];
    return res;
}
double f2(int x, int k)
{
    if (x>=k) return 0;
    double res=1;
    for(int i=1;i<=6;++i) res+=f2(x+i, k)*p[i];
    return res;
}
void getProb()
{
    double q=0;
    for(int i=1;i<=5;++i) {
        double l=0, r=1-q;
        for(int $=0;$<30;++$) {
            double m=(l+r)*.5;
            p[i]=m;
            if (f2(0, i+1)<E[i+1])
                l=m;
            else
                r=m;
        }
        q+=p[i];
    }
    p[6]=1-q;
}
int main()
{
    getProb();
    int T; cin>>T;
    while (T--) {
        int n; cin>>n;
        fill(memo, memo+n, 0);
        cout<<setprecision(20)<<f(0, n)<<endl;
    }
}