#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n)           for(int(i)=0;(i)<(n);++(i))
#define REPEAT(i, k, n)     for(int(i)=(k);(i)<((k)+(n));++(i))
#define EPS 1e-9

double dp[1001000];
double dice[6];

double ans[] = {
    1.0000000000000000,
    1.0833333333333333,
    1.2569444444444444,
    1.5353009259259260,
    1.6915991512345676,
    2.0513639724794235,
};

int main(){
    // ダイスの目の確率を二分探索
    dice[5] = 1;
    REP(k,5){
        double a = 0, b = 1;
        while(abs(a-b) > EPS){
            double c = (a+b)/2; dice[k] = c;
            REP(i,k+2){
                double r = 0;
                REP(j,6) if(i-j >= 0) r += dp[i-j]*dice[j];
                dp[i+1] = r + 1;
            }
            if(dp[k+2] < ans[k+1]) a = c; else b = c;
        }
        dice[5] -= dice[k];
    }

    // DP
    REP(i,1000000){
        double r = 0;
        REP(j,6) if(i-j >= 0) r += dp[i-j]*dice[j];
        dp[i+1] = r + 1;
    }

    int T;
    cin >> T;
    REP(i,T){
        int N;
        cin >> N;
        printf("%.8f\n", dp[N]);
    }
    return 0;
}