#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }


int main() {
	const int MaxN = 1000000;
	vector<double> dp(MaxN+1);
	dp[1] = 1.0000000000000000;
	dp[2] = 1.0833333333333333;
	dp[3] = 1.2569444444444444;
	dp[4] = 1.5353009259259260;
	dp[5] = 1.6915991512345676;
	dp[6] = 2.0513639724794235;
	double p[7] = {};
	rer(i, 1, 5) {
		//dp[i+1] = 1 + \sum_{j=1}^i p[j] * dp[i+1-j]
		double x = 1;
		rer(j, 1, i-1)
			x += p[j] * dp[i + 1 - j];
		p[i] = dp[i + 1] - x;
//		cerr << "p[" << i << "]: " << p[i] << endl;
	}
	p[6] = 1 - accumulate(p + 1, p + 6, 0.);
	rer(i, 7, MaxN) {
		double x = 1;
		rer(j, 1, 6) if(i - j >= 0)
			x += p[j] * dp[i - j];
		dp[i] = x;
	}
	int T;
	scanf("%d", &T);
	rep(ii, T) {
		int N;
		scanf("%d", &N);
		double ans = dp[N];
		printf("%.10f\n", ans);
	}
	return 0;
}