#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
vector<double> z={1.0/12,1.0/6,1.0/4,1.0/12,1.0/4,1.0/6};
double memo[1000010];
ll k;
double dfs(ll v){
    if(v>=k)return 0;
    if(memo[v]!=-1)return memo[v];
    double ret=1;
    rep(i,6){
        ret+=z[i]*dfs(v+i+1);
    }
    memo[v]=ret;
    return ret;
}
int main(){
    ll n;cin >> n;
    CST(10);
    while(n--){
        cin >> k;rep(i,1000010)memo[i]=-1;
        cout << dfs(0) <<endl;
    }
}