#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) for(int i=(n); i>=1; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

#define SIZE 222

int N,K,T;
double _DP[SIZE], *DP;
double _P[SIZE], *P;

void solve() {
    cin>>T;
    DP = _DP+10;
    P = _P+10;
    while(T--) {
        cin>>K;
        if (K>200) {
            out("%.14f\n", K + 0.6666666666667425);
            return;
        }
        REP(i,SIZE) _DP[i]=_P[i]=0;
        P[0] = 1.0;
        REP1(i,K) {
            REP1(j,6) {
                DP[i] += DP[i-j];
                P[i] += P[i-j];
            }
            DP[i] /= 6;
            DP[i] += 1;
            P[i] /= 6;
        }
        out("%.14f\n", DP[K]/P[K]);
    }
}