#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<climits>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<queue>
#include<stack>
#include<utility>
using namespace std;
long long a[10400];
double solve(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 main() {
    int t,n;
    scanf("%d",&t);
    while(t--){
        scanf("%d",&n);
        double ans=0;
        int cur;
        bool flag=false;
        for(int i=0;i<=100;i++){
            if(i==1) i=60;
            cur=i;
            if(cur>n||flag){
                flag=true;
                break;
            } 
            for(int j=i;j<=100;++j){
                cur=i+j;
                if(cur>n||flag){
                    flag=true;
                    break;
                } 
                for(int k=j;k<=100;++k){
                    cur=i+j+k;
                    if(cur>n||flag){
                        flag=true;
                        break;
                    } 
                    int c=n-k-j-i;
                    ans=max(ans,solve(i)+solve(k)+solve(j)+solve(c));
                }
            } 
        } 
        printf("%.1f\n",ans);
    }
    return 0;
}