#include <bits/stdc++.h>
#define rep(i, a, b) for(int i = (int)a; i <= (int)b; i ++)
#define ll long long
using namespace std;

const int maxn = 30010;
double dp[maxn], val[maxn], ndp[maxn];

bool check(int x) {
    for(int i = 2; i * i <= x; i ++)
        if(x % i == 0) return 0;
    return 1;
}

void prework() {
    vector < int > primes;
    int n = 30000;
    rep(i, 2, n) if(check(i)) primes.push_back(i);
    rep(i, 1, n) val[i] = log(i);
    for(auto p : primes) {
        int cur = p, cnt = 1;
        for(int i = cur; i <= n; i *= cur, cnt ++) {
            for(int j = i; j <= n; j ++)
                ndp[j] = max(ndp[j], dp[j - i] + cnt * val[p]);
        }
        memcpy(dp, ndp, sizeof(dp));
    }
}

void solve() {
    int b;
    cin >> b;
    cout << fixed << setprecision(12) << dp[b] << "\n";
}

int main() {
    ios :: sync_with_stdio(false);
    cin.tie(0);
    prework();
    int T;
    cin >> T;
    while(T --) solve();
    return 0;
}