#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<map>
#include<queue>
#include<vector>
#define ll long long
#define PI acos(-1.0)
#define F first
#define S second
#define pb push_back
#define debug(x); printf("debug%d\n",x);
#define des(x); printf("des:%s\n",x+1);
#define rep(f,t) for(int i=f;i<=t;i++)
const ll INF=0x3f3f3f3f3f3f3f3f;
const int inf=0x3f3f3f3f;
const int mod=998244353;
using namespace std;
int t;
int x;
int a[20];
double b[20];
double dp[410][5];
int main()
{
    scanf("%d",&t);
    a[1]=95;a[2]=90;a[3]=85;a[4]=80;
    a[5]=75;a[6]=70;a[7]=67;a[8]=65;
    a[9]=62;a[10]=60;a[11]=0;
    b[1]=4.3;b[2]=4.0;b[3]=3.7;b[4]=3.3;
    b[5]=3.0;b[6]=2.7;b[7]=2.3;b[8]=2.0;
    b[9]=1.7;b[10]=1.0;b[11]=0.0;
    while(t--)
    {
        memset(dp,0.0,sizeof dp);
        scanf("%d",&x);
        for(int i=1;i<=x;i++)
        {
            for(int j=1;j<=11;j++)
            {
                for(int k=1;k<=4;k++)
                {
                    if(i>=a[j])
                    {
                        dp[i][k]=max(dp[i][k],dp[i-a[j]][k-1]+b[j]);
                    }
                    if(k>=2&&i>=2.0*a[j])
                    {
                        dp[i][k]=max(dp[i][k],dp[i-2*a[j]][k-2]+2.0*b[j]);
                    }
                    if(k>=3&&i>=3.0*a[j])
                    {
                        dp[i][k]=max(dp[i][k],dp[i-3*a[j]][k-3]+3.0*b[j]);
                    }
                    if(k>=4&&i>=4.0*a[j])
                    {
                        dp[i][k]=max(dp[i][k],dp[i-4*a[j]][k-4]+4.0*b[j]);
                    }
                }
            }
        }
        double ans=0.0;
            //debug(i);
        ans=max(ans,dp[x][4]);
        ans=max(ans,dp[x][3]);
        ans=max(ans,dp[x][2]);
        ans=max(ans,dp[x][1]);
        ans=max(ans,dp[x][0]);
        printf("%.1f\n",ans);
    }
    return 0;
}