#include <bits/stdc++.h>
using std::cin;
using std::cout;
using std::endl;
using std::set;
using std::map;
using std::min;
using std::max;
using std::vector;
using std::deque;
using std::min;
using std::max;
using std::swap;
using std::string;
typedef long long ll;
typedef double db;
const int MOD = 998244353;
const int N = 100005;
ll power(const ll & x,const ll & mi)
{
    ll s1=1LL,s2=x,m=mi;
    while (m)
    {
        if (m&1) s1=s1*s2%MOD;
        s2=s2*s2%MOD;
        m>>=1;
    }
    return s1;
}
db c[105];
void solve()
{
    db ans=0;
    int n;
    cin>>n;
    for (int i=60;i<=min(n,100);++i)
    {
        ans=max(ans,c[i]);
        for (int j=60;j<=min(n-i,100);++j)
        {
            ans=max(ans,c[i]+c[j]);
            for (int k=60;k<=min(n-i-j,100);++k)
            {
                ans=max(ans,c[i]+c[j]+c[k]+c[max(0,n-i-j-k)]);
            }
        }
    }
    printf("%.1f\n",ans);
    return;
}
int main()
{
    for (int i=0;i<60;++i) c[i]=0;
    for (int i=60;i<=61;++i) c[i]=1;
    for (int i=62;i<=64;++i) c[i]=1.7;
    for (int i=65;i<=66;++i) c[i]=2.0;
    for (int i=67;i<=69;++i) c[i]=2.3;
    for (int i=70;i<=74;++i) c[i]=2.7;
    for (int i=75;i<=79;++i) c[i]=3.0;
    for (int i=80;i<=84;++i) c[i]=3.3;
    for (int i=85;i<=89;++i) c[i]=3.7;
    for (int i=90;i<=94;++i) c[i]=4.0;
    for (int i=95;i<=100;++i) c[i]=4.3;
    int T=1;
    cin>>T;
    while (T--) solve();
    return 0;
}