#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
typedef long long ll;
const int N = 3e4;
double f[N + 5];
int cnt[N + 5], vis[N + 5], num = 0;
int prime[N + 5], val[N + 5][20];
int T, b;

void init()
{
    vis[0] = vis[1] = 1;
    for(int i = 2; i <= N; i++)
    {
        if(!vis[i]) prime[++num] = i;
        for(int j = 1; j <= num && i * prime[j] <= N; j++)
        {
            vis[i * prime[j]] = 1;
            if(i % prime[j] == 0) break;
        }
    }
    for(int i = 1; i <= num; i++)
    {
        int len = 1;
        int tempV = pow(prime[i], len);
        while(tempV <= N)
        {
            val[i][len++] = tempV;
            tempV = pow(prime[i], len);
        }
        cnt[i] = len - 1;
    }
}

void solve()
{
    fill(f, f + N + 1, 1);
    for(int i = 1; i <= num; i++)
    {
        for(int j = N; j >= 1; j--)
        {
            for(int k = 1; k <= cnt[i]; k++)
            {
                if(j >= val[i][k])
                    f[j] = max(f[j], f[j - val[i][k]] * (double)val[i][k]);
            }
        }
    }
}


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