#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <stdio.h>
const int Max = 100 * 100 * 100 + 5;
#define LL long long
int mod = 1e9+7;
const int INF = 1e5;
//const int inx = INT_MAX;
using namespace std;
//  srand(time(NULL));
//      m = rand() % 1000 + 1;

//定义i i(A) i+n i+n(B) i+n+n i+n+n(C)
//bitset<Max>s,q;

typedef struct {
    double s,d;
}S;
int main()
{
    S s[15];
    int t,i,j,k,p;
    s[1].s = 0,s[1].d = 0;
    s[2].s = 60,s[2].d = 1;
    s[3].s = 62,s[3].d =1.7;
    s[4].s = 65,s[4].d =2.0;
    s[5].s = 67,s[5].d =2.3;
    s[6].s = 70,s[6].d =2.7;
    s[7].s = 75,s[7].d =3.0;
    s[8].s = 80,s[8].d =3.3;
    s[9].s = 85,s[9].d =3.7;
    s[10].s = 90,s[10].d =4.0;
    s[11].s = 95,s[11].d =4.3;
    scanf("%d",&t);
    while(t--){
        double sum1,sum2,x,m,n,n1,n2,n3,k1,k2,k3,k4;
        sum1 = sum2 = 0;
        scanf("%lf",&x);
        for(i = 1; i <= 11; i++){
            n = x;
            m = n - s[i].s;
            k1 = 0;
            if(m >= 0) k1 += s[i].d,n = x - s[i].s;
            if(n <= 59) {
                    sum2 = max(k1,sum2);
                    continue;
                }
            for(j = 1; j <= 11; j++){
                k2 = k1;
                m = n - s[j].s;
                n1 = n;
                if(m >= 0) k2 += s[j].d,n1 = n - s[j].s;
                if(n1 <= 59) {
                    sum2 = max(k2,sum2);
                    continue;
                }
                for(k = 1; k <= 11; k++){
                    m = n1 - s[k].s;
                    k3 = k2;
                    n2 = n1;
                    if(m >= 0) k3 += s[k].d,n2 = n1 - s[k].s;
                    if(n2 <= 59) {
                    sum2 = max(k3,sum2);
                    continue;
                  }
                    for(p = 1; p <= 11; p++){
                        k4 = k3;
                        n3 = n2;
                        if(n3 >= 95){
                            k4 += 4.3;
                            break;
                        }
                        if(s[p].s > n3) {
                            k4 += s[p-1].d; 
                            break;
                        }
                    }
                    sum2 = max(k4 ,sum2);
                }
            }
        }
        printf("%.1f\n",sum2);
    }    
    return 0;
}