#include<bits/stdc++.h>
typedef long long ll;
ll gi(){
    ll x=0,f=1;
    char ch=getchar();
    while(!isdigit(ch))f^=ch=='-',ch=getchar();
    while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
    return f?x:-x;
}
std::mt19937 rnd(time(NULL));
#define rand rnd
#define pr std::pair<int,int>
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
template<class T>void cxk(T&a,T b){a=a>b?a:b;}
template<class T>void cnk(T&a,T b){a=a<b?a:b;}
#ifdef mod
int pow(int x,int y){
    int ret=1;
    while(y){
        if(y&1)ret=1ll*ret*x%mod;
        x=1ll*x*x%mod;y>>=1;
    }
    return ret;
}
template<class Ta,class Tb>void inc(Ta&a,Tb b){a=a+b>=mod?a+b-mod:a+b;}
template<class Ta,class Tb>void dec(Ta&a,Tb b){a=a>=b?a-b:a+mod-b;}
#endif
int A[]={0,60,62,65,67,70,75,80,85,90,95},B[]={0,10,17,20,23,27,30,33,37,40,43};
int main(){
#ifdef LOCAL
    freopen("in.in","r",stdin);
    //freopen("out.out","w",stdout);
#endif
    int qwq=gi();
    while(qwq--){
        int sum=gi(),ans=0;
        for(int a=0;a<11;++a)
        for(int b=0;b<11;++b)
        for(int c=0;c<11;++c)
        for(int d=0;d<11;++d)
            if(A[a]+A[b]+A[c]+A[d]<=sum)cxk(ans,B[a]+B[b]+B[c]+B[d]);
        printf("%.1lf\n",ans/10.);
    }
    return 0;
}