#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 K = 1000;
	const int X = 6;
	vector<pair<long double,long double> > dp(K + 1);
	for(int i = 1; i <= K; ++ i) {
		double c1 = 0, c0 = 0;
		rer(j, 1, 6) {
			auto p = i - j < 0 ? mp(1.L, 0.L) : dp[i - j];
			c1 += p.first / 6;
			c0 += (1 + p.second) / 6;
		}
		dp[i] = make_pair(c1, c0);
	}
	vector<long double> anssmall(K + 1);
	rer(i, 1, K)
		anssmall[i] = dp[i].second / (1 - dp[i].first);

	int T;
	scanf("%d", &T);
	for(int ii = 0; ii < T; ++ ii) {
		long long N;
		scanf("%lld", &N);
		long double ans;
		if(N <= K) {
			ans = anssmall[(int)N];
		} else {
			ans = anssmall[K] + (anssmall[K] - anssmall[K - 1]) * (N - K);
		}
		printf("%.20Lf\n", ans);
	}
	return 0;
}