#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define ll long long int

ll read(){
    char ch=getchar();
    ll sum=0;
    bool ttt=false;
    while(!isdigit(ch)) ttt=(ch=='-'),ch=getchar();
    while(isdigit(ch)) sum=(sum<<3)+(sum<<1)+(ch-'0'),ch=getchar();
    return ttt?-sum:sum;
}

int tst;
int n,m;
double ans[500];
const int a[11]={0,60,62,65,67,70,75,80,85,90,95},c[11]={59,1,2,1,2,4,4,4,4,4,5};
const double b[11]={0.0,1.0,1.7,2.0,2.3,2.7,3.0,3.3,3.7,4.0,4.3};

int main(){
    tst=read();
    for(int t=1;t<=tst;t++){
        n=read();
        if(ans[n]>0){
            printf("%.1lf\n",ans[n]);
            continue;
        }
        for(int i=0;i<=10;i++){
            if(a[i]>n) break;
            for(int j=i;j<=10;j++){
                if(a[i]+a[j]>n) break;
                for(int k=j;k<=10;k++){
                    int temp=a[i]+a[j]+a[k];
                    double tns=b[i]+b[j]+b[k];
                    if(temp>n) break;
                    for(int p=10;p>=0;p--){
                        if(n-temp>=a[p]){
                            if(m-temp-a[p]<=c[i]+c[j]+c[k]+c[p]) ans[n]=max(ans[n],tns+b[p]);
                            break;
                        }
                    }
                }
            }
        }    
        printf("%.1lf\n",ans[n]);
    }
    return 0;
}