#include <bits/stdc++.h>
#include <immintrin.h>

using namespace std;

using ll = long long;
using ld = long double;
# define x first
# define y second
# define all(x) x.begin(), x.end()
# define rall(x) x.rbegin(), x.rend()

mt19937 mt(123);

void solve();
void init();

const int A = 12;
double buba[A], nw[A];
bool prime[A];

int32_t main() {
#ifndef LOCAL
    cin.tie(nullptr)->sync_with_stdio(false);
#endif
    cout << fixed << setprecision(30);
    init();
    fill(prime + 2, prime + A, true);
    vector<int> items;
    for (int i = 2; i < A; ++i) {
        if (prime[i]) {
            items.push_back(i);
            for (int j = 2 * i; j < A; j += i) prime[j] = false;
        }
    }
    for (auto x : items) {
        for (int i = A - 1; i >= 0; --i) {
            double ss = log(x);
            double qq = ss;
            for (int p = x; i + p < A; p *= x, qq += ss) {
                buba[i + p] = max(buba[i + p], buba[i] + qq);
            }
        }
    }
    cout << fixed << setprecision(10);
    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }
}

void init() {}

void solve() {
    int b;
    cin >> b;
    cout << buba[b] << '\n';
}