#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 30000 + 5;

int pri[MAX_N], pcnt;
char np[MAX_N];
double f[MAX_N];

void init() {
    for (int i = 2; i < MAX_N; i ++) {
        if (!np[i]) {
            pri[++ pcnt] = i;
            static double g[MAX_N];
            for (int j = i; j < MAX_N; j *= i) {
                const double w = log((double)j);
                for (int k = MAX_N - 1; k >= j; k --) {
                    g[k] = max(g[k], f[k - j] + w);
                }
            }
            memcpy(f, g, sizeof f);
        }
        for (int j = 1; j <= pcnt && i * pri[j] < MAX_N; j ++) {
            np[i * pri[j]] = 1;
            if (i % pri[j] == 0) break;
        }
    }
}

int main() {
    init();
    int T;
    scanf("%d", &T);
    while (T --) {
        int x;
        scanf("%d", &x);
        printf("%.10lf\n", f[x]);
    }
    return 0;
}