#include<bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define uint unsigned
#define pii pair<int,int>
#define pll pair<ll,ll>
#define IT iterator
#define PB push_back
#define fi first
#define se second
#define For(i,j,k) for (int i=(int)(j);i<=(int)(k);i++)
#define Rep(i,j,k) for (int i=(int)(j);i>=(int)(k);i--)
#define CLR(a,v) memset(a,v,sizeof(a));
#define CPY(a,b) memcpy(a,b,sizeof(a));
#define debug puts("wzpakking")
#define y1 ysghysgsygsh 
using namespace std;

double f[505],g[505],p[505];
void solve(){
    For(i,95,100) p[i]=4.3;
    For(i,90,94) p[i]=4.0;
    For(i,85,89) p[i]=3.7;
    For(i,80,84) p[i]=3.3;
    For(i,75,79) p[i]=3.0;
    
    For(i,70,74) p[i]=2.7;
    For(i,67,69) p[i]=2.3;
    For(i,65,66) p[i]=2.0;
    For(i,62,64) p[i]=1.7;
    For(i,60,61) p[i]=1.0;
    
    memset(f,0,sizeof(f));
    int n;
    cin>>n;
    For(i,1,4){
        memset(g,0,sizeof(g));
        For(j,0,400) For(k,0,100)
            g[k+j]=max(g[k+j],f[j]+p[k]);
        memcpy(f,g,sizeof(f));
    }
    printf("%.1lf\n",f[n]);
}
int main(){
    int T;
    scanf("%d",&T);
    while (T--) solve();
}