#include <cstdio>
#include <algorithm>
#include <iostream>
#include <ctime>
#include <cmath>
using namespace std;
int n,m,T;
double ans;
double f[7][404];
double trans(int x){
    if(x>=95)return 4.3;
    if(x>=90)return 4.0;
    if(x>=85)return 3.7;
    if(x>=80)return 3.3;
    if(x>=75)return 3.0;
    if(x>=70)return 2.7;
    if(x>=67)return 2.3;
    if(x>=65)return 2.0;
    if(x>=62)return 1.7;
    if(x>=60)return 1.0;
    return 0.0;    
}
int get(){
    char t=getchar();
    while(t<'0'||t>'9')t=getchar();
    int x = 0;
    while(t>='0'&&t<='9'){
        x*=10;
        x+=t-'0';
        t=getchar();
    }
    return x;
}
int main()
{
    for(int i=0;i<4;++i){
        for(int j=0;j<=100*i;++j)
            for(int k=0;k<=100;++k){
                f[i+1][j+k] = max(f[i+1][j+k], f[i][j] + trans(k));
            }
    }
    T = get();
    for(int ii=0;ii<T;++ii){
        n = get();
        printf("%.1lf\n",f[4][n]);
    }
    return 0;
}