// 基本テンプレート
 
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
using namespace std;
 
#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define int long long int
 
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
 
typedef pair<int, int> pii;
typedef long long ll;
 
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const ll INF = 1001001001001001LL;
const ll MOD = 1000000007LL;

double info[7] = {0, 1.0000000000000000, 1.0833333333333333, 1.2569444444444444, 1.5353009259259260, 1.6915991512345676, 2.0513639724794235};
double p[7], dp[1000010];

signed main() {
    p[6] = 1.0;
    for(int k=2; k<=6; k++) {
        double val = info[k] - 1;
        for(int x=1; x<k-1; x++) val -= info[k-x] * p[x];
        p[k-1] = val;
        p[6] -= val;
    }

    for(int k=1; k<1000010; k++) {
        for(int x=1; x<=min(6LL, k); x++) {
            dp[k] += p[x] * dp[k-x];
        }
        dp[k] += 1;
    }

    int T; scanf("%lld", &T);
    while(T--) {
        int V; scanf("%lld", &V);
        printf("%.12f\n", dp[V]);
    }
    return 0;
}