#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <iomanip>
#include <sys/time.h>
#include <random>
using namespace std;

#define endl '\n'
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define UNIQ(v) (v).erase(unique((v).begin(), (v).end()), (v).end())

typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef complex<double> comp;
typedef vector< vector<ld> > matrix;
struct pairhash {
public:
    template<typename T, typename U>
    size_t operator()(const pair<T, U> &x) const {
	size_t seed = hash<T>()(x.first);
	return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
    }
};
const int inf = 1e9 + 9;
const ll mod = 1e9 + 7;
const double eps = 1e-8;
const double pi = acos(-1);

int t;
int n;

double p[7] = {0.0,0.083333333333333,
               0.166666666666667,
               0.250000000000000,
               0.083333333333333,
               0.250000000000000,
               0.166666666666667};

double memo[1000010];

double calc(int k) {
    if (k <= 0) return 0.0;
    if (memo[k] < 0) {
        double res = 0.0;
        for (int i = 1; i <= 6; i++) {
            res += (1+calc(k-i)) * p[i];
        }
        memo[k] = res;
    }
    return memo[k];
}

double solve() {
    return calc(n);
}

void input() {
    fill(memo, memo+1000010, -1.0);
    cin >> t;
    for (int i = 0; i < t; i++) {
        cin >> n;
        cout << solve() << endl;
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);

    input();
}