#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define each(a, b) for(auto (a): (b))
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define pb push_back
#define show(x) cout <<#x<<" = "<<(x)<<endl
#define spair(p) cout <<#p<<": "<<p.fi<<" "<<p.se<<endl
#define svec(v) cout<<#v<<":";rep(kbrni,v.size())cout<<" "<<v[kbrni];cout<<endl
#define sset(s) cout<<#s<<":";each(kbrni,s)cout <<" "<<kbrni;cout<<endl

using namespace std;

typedef pair<int,int>P;

const int MAX_N = 1000001;

double dp[MAX_N];
double p[7];

int main()
{
    int n;
    cin >> n;
    dp[1] = 1;
    dp[2] = 1.0833333333333333;
    dp[3] = 1.2569444444444444;
    dp[4] = 1.5353009259259260;
    dp[5] = 1.6915991512345676;
    dp[6] = 2.0513639724794235;
    rep(i,5){
        double bf = dp[i+2];
        rep(j,i){
            bf -= p[j+1]*dp[i-j+1];
        }
        p[i+1] = bf-1;
    }
    p[6] = 1;
    rep(i,5){
        p[6] -= p[i+1];
    }
    for(int i=7;i<1000001;i++){
        rep(j,6){
            dp[i] += p[j+1]*dp[i-j-1];
        }
        dp[i] += 1;
    }
    rep(i,n){
        int a;
        cin >> a;
        printf("%.10f\n",dp[a]);
    }
    return 0;
}