#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>

using namespace std;

int main(){

    long double tot=0;
    vector<long double> p(7), dp(1000001), s = {0.0, 1.0000000000000000, 1.0833333333333333, 1.2569444444444444, 1.5353009259259260, 1.6915991512345676, 2.0513639724794235};
    for (int i=1; i<=5; i++){
        tot = s[i+1]-1;
        for (int j=1; j<i; j++) tot -= s[i-j+1] * p[j];
        p[i] = tot;
    }

    p[6] = 1;
    for (int i=1; i<=5; i++) p[6] -= p[i];
    for (int i=1; i<=1000000; i++){
        dp[i] = 1;
        for (int j=1; j<=6; j++){
            if (i-j >= 0) dp[i] += dp[i-j] *  p[j];
        }
    }

    long long T, N;
    cin >> T;
    for (int i=0; i<T; i++){
        cin >> N;
        cout << setprecision(18) << dp[N] << endl;
    }

    return 0;
}