#include <bits/stdc++.h>
using namespace std;

#define co(n) cout<<n<<endl;
const double eps=1e-10,pi=3.1415926535898;
const int mod=1e9+7,maxn=20;
int T,n,m,x[maxn]={0,0,60,62,65,67,70,75,80,85,90,95};
double y[maxn]={0,0,1.0,1.7,2.0,2.3,2.7,3.0,3.3,3.7,4.0,4.3};

struct P{
    int x;
    double y;
    bool operator <(const P& a) const {
        if (x == a.x) return y<a.y;
        return x<a.x;
    }
};

int main(int argc, char const *argv[]) {
    T = 1;
    scanf("%d", &T);
    for (int _=1;_<=T;++_) {
        double ans=0;
        scanf("%d", &n);
        for (int i=1;i<=11;++i) {
            for (int j=i;j<=11;++j) {
                for (int k=j;k<=11;++k) {
                    for (int l=k;l<=11;++l) {
                        if (x[i]+x[j]+x[k]+x[l] > n) continue;
                        ans = max(ans, y[i]+y[j]+y[k]+y[l]);
                    }
                }
            }
        }
        printf("%.1lf\n", ans);
    }
    return 0;
}

/*
      T
W     L
A C M E R
  E L   E
    E
*/