#include <cstdio>
#include <vector>
#define repeat(i,n) for (int i = 0; (i) < (n); ++(i))
#define repeat_reverse(i,n) for (int i = (n)-1; (i) >= 0; --(i))
typedef long long ll;
using namespace std;
int main() {
    int t; scanf("%d", &t);
    while (t --) {
        ll n; scanf("%lld", &n);
        long double ans;
        if (n <= 200) {
            vector<long double> e(n+6);
            vector<long double> p(n+6);
            e[n  ] = 0; p[n  ] = 1;
            e[n+1] = 0; p[n+1] = 0;
            e[n+2] = 0; p[n+2] = 0;
            e[n+3] = 0; p[n+3] = 0;
            e[n+4] = 0; p[n+4] = 0;
            e[n+5] = 0; p[n+5] = 0;
            repeat_reverse (i,n) {
                e[i] = 1;
                p[i] = 0;
                repeat (j,6) {
                    e[i] += e[i+1+j] / 6;
                    p[i] += p[i+1+j] / 6;
                }
            }
            ans = e[0] / p[0];
        } else {
            ans = n + 5./3;
        }
        printf("%.13Lf\n", ans);
    }
    return 0;
}