#pragma GCC optimize("Ofast", "inline", "-ffast-math")
#include <bits/stdc++.h>

using namespace std;
using LL = long long;
using ll = long long;
using LD = long double;

vector<int> prim;
constexpr int N = 3E4 + 10;
bool is[N];

int sieve = []() {
    for (int i = 2; i < N; i++) {
        if (!is[i]) {
            prim.emplace_back(i);
            for (int j = i + i; j < N; j += i) {
                is[j] = 1;
            }
        }
    }
    return 0;
}();

//int powe(LD x) {
//    return pow(2.718281828L, x);
//}
//constexpr LL inf = 1E18;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    vector<LD> f(N);
    for (int x : prim) {
        LD lg = log(x);
        LD s = 0;
        vector<LD> g(f);
        for (int i = x; i < N; i *= x) {
            s += lg;
            for (int j = N - 1; j >= i; j--) {
                g[j] = max(f[j - i] + s, g[j]);
            }
        }
        f = std::move(g);
    }

    cout << fixed << setprecision(20);
//    for (int i = 1; i < N; i++) {
//        f[i] = max(f[i - 1], f[i]);
//    }

    int t;
    cin >> t;
    while (t--) {
        int b;
        cin >> b;
        cout << f[b] << "\n";
    }
}