#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define int long long
vector<int> minp, primes;

void sieve(int n) {
    minp.assign(n + 1, 0);
    primes.clear();
    
    for (int i = 2; i <= n; i++) {
        if (minp[i] == 0) {
            minp[i] = i;
            primes.push_back(i);
        }
        
        for (auto p : primes) {
            if (i * p > n) {
                break;
            }
            minp[i * p] = p;
            if (p == minp[i]) {
                break;
            }
        }
    }
}
const int N = 3e4 + 10;
ld dp[N];
ld lg[N];
void solve() {
    int n;
    cin >> n;
    cout << dp[n] << "\n";
}          
    
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    cout << fixed << setprecision(9) << "\n";
    for(int i = 1; i < N; i++) {
        lg[i] = log(i);
    }
    sieve(N);
    for(int i = 0; i < (int)primes.size(); i++) {
        for(int k = N - 1; k >= primes[i]; k--) {
            for(int j = primes[i]; j * primes[i] < N; j *= primes[i]) {
                if(k - j >= 0) {
                    dp[k] = max(dp[k], dp[k - j] + lg[j]);
                }
            }
        }
    }


    int T = 1;
    cin >> T;
    while(T--) solve();

    return 0;
}