#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <iomanip>
using namespace std;

#define REP(i,s,e) for (i = s; i <= e; i++)
#define rep(i,n) REP (i,0,(int)(n)-1)
#define RREP(i,s,e) for (i = s; i >= e; i--)
#define rrep(i,n) RREP (i,(int)(n)-1,0)
#define INF (int)1e8
#define MOD (int)(1e9+7)

typedef long long ll;

double dp[1001001];

double f(int x) {
    if (x >= 0)
        return dp[x];
    else
        return 0;
}

int main(void) {
    int i, j, k;
    REP (i,1,(int)1e6) {
        dp[i] = 1;
        dp[i] += f(i-1) / 12;
        dp[i] += f(i-2) / 6;
        dp[i] += f(i-3) / 4;
        dp[i] += f(i-4) / 12;
        dp[i] += f(i-5) / 4;
        dp[i] += f(i-6) / 6;
    }

    int t;
    cin >> t;
    while (t--) {
        int n;
        cin >> n;
        cout << fixed << setprecision(7) << dp[n] << endl;
    }
    return 0;
}