//Awwawa! Dis cold yis ratten buy tEMMIE!
#include <bits/stdc++.h>
#define ll long long
#define maxn 100005 /*rem*/
#define mod 998244353
#define db double
#define vi vector<int>
#define pb push_back
#define mp make_pair
#define pi pair<int, int>
#define fi first
#define se second

template <typename T> bool chkmax(T &x,T y){return x<y?x=y,true:false;}
template <typename T> bool chkmin(T &x,T y){return x>y?x=y,true:false;}

using namespace std;
ll ksm(ll a, ll b) {
   if (!b) return 1;
   ll ns = ksm(a, b >> 1);
   ns = ns * ns % mod;
   if (b & 1) ns = ns * a % mod;
   return ns;
}
int lb[30] = {0, 60, 62, 65, 67, 70, 75, 80, 85, 90, 95};
db r[30] = {0, 1.0, 1.7, 2.0, 2.3, 2.7, 3.0, 3.3, 3.7, 4.0, 4.3};
db mx[5][405];
db sq[105];
int main() {
    for (int i = 0; i <= 100; i++)
        for (int j = 0; j < 30; j++)
            if (i >= lb[j]) chkmax(sq[i], r[j]);
    for (int i = 1; i <= 4; i++)
        for (int j = 0; j <= 400; j++)
            for (int k = 0; k <= min(100, j); k++)
                chkmax(mx[i][j], mx[i - 1][j - k] + sq[k]);
    int t;
    cin >> t;
    while (t--) {
        int x;
        scanf("%d", &x);
        printf("%.1lf\n", mx[4][x]);
    }
    return 0;
}