#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
double Max;
const int N=11;
int mi[N]={95,90,85,80,75,70,67,65,62,60,0};
int ma[N]={100,94,89,84,79,74,69,66,64,61,59};
double scores[N]={4.3,4.0,3.7,3.3,3.0,2.7,2.3,2.0,1.7,1.0,0};
double calc(double score)
{
    if(score>=95)
        return scores[0];
    else if(score>=90)
        return scores[1];
    else if(score>=85)
        return scores[2];
    else if(score>=80)
        return scores[3];
    else if(score>=75)
        return scores[4];
    else if(score>=70)
        return scores[5];
    else if(score>=67)
        return scores[6];
    else if(score>=65)
        return scores[7];
    else if(score>=62)
        return scores[8];
    else if(score>=60)
        return scores[9];
    else
        return scores[10];
}
void dfs(int i,int Sum,double score)
{
    if(Sum<0)
        return;
    if(i==3)
    {
        Max=max(Max,calc(Sum)+score);
        return ;
    }
    for(int ii=0;ii<N;ii++)
        dfs(i+1,Sum-mi[ii],score+scores[ii]);
}
int main()
{
    int T,n;
    while(~scanf("%d",&T))
    {
        while(T--)
        {
            scanf("%d",&n);
            Max=0;
            dfs(0,n,0);
            printf("%.1lf\n",Max);
        }
    }
}