#include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < (a); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
#define repr(i, a) for (int i = (a) - 1; i >= 0; i--)
#define repr2(i, a, b) for (int i = (b) - 1; i >= (a); i--)
using namespace std;
typedef long long ll;
const ll inf = 1e9;
const ll mod = 1e9 + 7;

double P[7];
double dp[1010101];

double E(int n) {
	if (n <= 0) return 0;	
	if (dp[n] >= 0) return dp[n];
	double res = 0;
	for (int i = 1; i <= 6; i++) {
		res += P[i] * (E(n - i) + 1);
	}
	return dp[n] = res;
}

int main() {
	int T;
	cin >> T;

	rep (i, 1010101) dp[i] = -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;

	P[1] = (dp[2] - 1) / dp[1];
	P[2] = (dp[3] - P[1] * dp[2] - 1) / dp[1];
	P[3] = (dp[4] - P[1] * dp[3] - P[2] * dp[2] - 1) / dp[1];
	P[4] = (dp[5] - P[1] * dp[4] - P[2] * dp[3] - P[3] * dp[2] - 1) / dp[1];
	P[5] = (dp[6] - P[1] * dp[5] - P[2] * dp[4] - P[3] * dp[3] - P[4] * dp[2] - 1) / dp[1];
	P[6] = 1 - P[1] - P[2] - P[3] - P[4] - P[5];

	while (T--) {
		int N;
		cin >> N;
		printf("%.20f\n", E(N));
	}

	return 0;
}