#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<map>
using namespace std;
const int N=11,Inf=1e9+7;
int a[]={0,60,62,65,67,70,75,80,85,90,95};
double s[]={0.0,1.0,1.7,2.0,2.3,2.7,3.0,3.3,3.7,4.0,4.3};
int n;
int main(){
    map<int,double> mp;
    for(int i=0;i<N;++i)
        mp.insert({a[i],s[i]});
    int T;
    scanf("%d",&T);
    while(T--){
        scanf("%d",&n);
        double res=0.0;
        for(int x=N-1;x>=0;--x){
            for(int y=N-1;y>=0;--y){
                for(int z=N-1;z>=0;--z){
                    int q=n-a[x]-a[y]-a[z];
                    if(q<0) continue;
                    if(q>=95) q=95;
                    else{
                        int i=upper_bound(a,a+N,q)-a;
                        q=a[i-1];    
                    }
                    double ans=mp[a[x]]+mp[a[y]]+mp[a[z]]+mp[q];
                    res=max(res,ans);
                }
            }
        }
        printf("%.1f\n",res);
    }
    return 0;
}