#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define x first
#define y second
typedef pair<int,int> pii;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> void chkmax(T &x,T y){x<y?x=y:T();}
template <typename T> void chkmin(T &x,T y){x>y?x=y:T();}
template <typename T> void readint(T &x)
{
    x=0;int f=1;char c;
    for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-1;
    for(;isdigit(c);c=getchar())x=x*10+c-'0';
    x*=f;
}
/*const int MOD=;
inline int dmy(int x){return x>=MOD?x-MOD:x;}
inline void inc(int &x,int y){x=dmy(x+y);}
int qmi(int x,int y)
{
    int ans=1;
    for(;y;y>>=1,x=1ll*x*x%MOD)
        if(y&1)ans=1ll*ans*x%MOD;
    return ans;
}*/ 

int a[11]={0,60,62,65,67,70,75,80,85,90,95},b[11]={0,10,17,20,23,27,30,33,37,40,43};
int f[5][405];
void solve()
{
    int x;
    readint(x);
    printf("%d.%d\n",f[4][x]/10,f[4][x]%10);
}

int main()
{
    #ifdef LOCAL
    freopen("code.in","r",stdin);
//    freopen("code.out","w",stdout);
    #endif
    f[0][0]=0;
    for(int i=1;i<=4;++i)
        for(int j=0;j<=400;++j)
            for(int k=0;k<=10;++k)
                if(j>=a[k])chkmax(f[i][j],f[i-1][j-a[k]]+b[k]);
    for(int j=1;j<=400;++j)chkmax(f[4][j],f[4][j-1]);
    int T;
    readint(T);
    while(T--)solve();
    return 0;
}