#include<iostream>
#include<stdio.h>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#include<string>
#include<stack>
#include<set>
#include<map>
#include<bitset>
//#include<unordered_map>
#include<time.h>
#include<cstdlib>
typedef long long ll;
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#define mm(a) memset(a,0,sizeof(a))
#define lr rt<<1
#define rr rt<<1|1
#define sync std::ios::sync_with_stdio(false);std::cin.tie(0);
#define inf 0x3f3f3f3f
//#define eqs 1e-8
#define lb(x) (x&(-x))
#define ch(a) (int(a-'a')+1)
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define mkp(a,b) make_pair(a,b)
using namespace std;
typedef pair<int,int> pii;
const double pi=acos(-1);
const int maxn=20010;
//const ll Mod=1000000007;
const ll Mod=998244353;
 
struct node
{
    int x;
    double w;
}a[20];
int b[20];
double c[20];

int main()
{
//    sync;
    int n;
    int t;
    int m;
    b[1]=0;
    b[2]=60;
    b[3]=62;
    b[4]=65;
    b[5]=67;
    b[6]=70;
    b[7]=75;
    b[8]=80;
    b[9]=85;
    b[10]=90;
    b[11]=95;
    b[12]=101;
    c[1]=0.0;
    c[2]=1.0;
    c[3]=1.7;
    c[4]=2.0;
    c[5]=2.3;
    c[6]=2.7;
    c[7]=3.0;
    c[8]=3.3;
    c[9]=3.7;
    c[10]=4.0;
    c[11]=4.3;
    for(int i=1;i<=11;i++)
    {
        a[i].x=b[i];
        a[i].w=c[i];
    }
//    cin>>t;
    scanf("%d",&t);
    while(t--)
    {
        int x;
        scanf("%d",&x);
        double mx=0;
        int s1,s2,s3,s4;
        double w1,w2,w3,w4;
        for(int i=1;i<=11;i++)
        {
            s1=x-b[i];
            w1=c[i];
            for(int j=1;j<=11;j++)
            {
                s2=s1-b[j];
                w2=w1+c[j];
                for(int k=1;k<=11;k++)
                {
                    s3=s2-b[k];
                    w3=w2+c[k];
//                    cout<<s3<<' '<<w3<<endl;
                    if(s3<0)
                        continue;
                    if(s3>=95)
                        s3=95;
                    int p=upper_bound(b+1,b+13,s3)-b-1;
                    w4=w3+c[p];
                    mx=max(mx,w4);
                }
            }
        }
        printf("%.1f\n",mx);
    }
    
    return 0;
}