#include <bits/stdc++.h>
#define all(n) (n).begin(), (n).end()
#define se second
#define fi first
#define pb push_back
#define mp make_pair
#define sqr(n) (n)*(n)
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
#define IO ios::sync_with_stdio(0); cin.tie(0)
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef double db;

const int N = 1e5 + 5;

int n, m, _, k;
int g[] = {60, 62, 65, 67, 70, 75, 80, 85, 90, 95, 101};
double h[] = {1, 1.7, 2.0, 2.3, 2.7, 3.0, 3.3, 3.7, 4.0, 4.3};
double ans = 0;

void dfs(int k, int w, double cur) {
    if (k == 5) { ans = max(ans, cur); return; } 
    rep (i, 0, w) {
        if (g[i] > n) break;
        n -= g[i];
        dfs(k + 1, i, cur + h[i]);
        n += g[i];
    }
    dfs(k + 1, 0, cur);
}

int main() {
    IO;
    for (cin >> _; _; --_) {
        cin >> n;
        dfs(1, 9, 0);
        printf("%.1lf\n", ans);
    } 
    return 0;
}