#include <iostream>
#include <iomanip> //<<setprecision(12), or <<fixed
#include <algorithm>
#include <functional>
#include <map>
#include <vector>
#include <queue>
#include <cmath>
#include <set>
 
using namespace std;

using ll=long long;
using ull=unsigned long long;
using pll=pair<ll,ll>;

int main()
{
    vector<double> X(6,0);
    vector<double> r={  1.0833333333333333,
                        1.2569444444444444,
                        1.5353009259259260,
                        1.6915991512345676,
                        2.0513639724794235  };
                        
    auto search=[&](ll K)
    {
        K+=2; //E_K+2=0, solve E_0
        vector<double> dp(K+6+1,0);
        
        for(ll i=K-1; i>=0; i--)
        {
            dp[i]+=1;
            for(ll k=0; k<6; k++)
            {
                dp[i]+=dp[i+k+1]*X[k];
            }
        }
        K-=2;
        
        X[K]=r[K]-dp[0];
    };
    
    double sum=0;
    for(ll i=0; i<5; i++){ search(i); sum+=X[i]; }
    X[5]=1-sum;
    
    //query
    ll N;
    cin>>N;
    
    while(--N>=0)
    {
        ll T;
        cin>>T;
        
        vector<double> dp(T+6+1,0);
        for(ll i=T-1; i>=0; i--)
        {
            dp[i]+=1;
            for(ll k=0; k<6; k++)
            {
                dp[i]+=dp[i+k+1]*X[k];
            }
        }
        
        cout<<fixed<<setprecision(15)<<dp[0]<<endl;
    }

    // Fear misreading.
    return 0;
}