#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
//#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
//#include<list>
#include<queue>
#include<deque>
#include<algorithm>
//#include<numeric>
#include<utility>
#include<complex>
//#include<memory>
#include<functional>
#include<cassert>
#include<set>
#include<stack>

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;

void solve(int K) {
    vector<double> a(K+6), b(K+6);
    for (int i = K+1; i < K+6; i++) a[i] = 1;
    for (int i = K-1; i >= 0; i--) {
        b[i] = 1;
        for (int j = 1; j <= 6; j++) {
            a[i] += a[i+j]/6;
            b[i] += b[i+j]/6;
        }
    }
    printf("%.15lf\n", b[0]/(1-a[0]));
}

int main() {
    int T;
    cin >> T;
    while (T--) {
        ll N;
        cin >> N;
        if (N <= 1000) {
            solve((int)N);
        } else {
            cout << N+1 << ".666666666666667" << endl;
        }
    }
    return 0;
}