#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int MAXN = 104;

int x[MAXN], y[MAXN];

int main() {
    int T; scanf("%d", &T);
    int b[12] = {95, 90, 85, 80, 75, 70, 67, 65, 62, 60, 0};
    int d[12] = {100, 94, 89, 84, 79, 74, 69, 66, 64, 61, 59};
    double c[12] = {4.3, 4.0, 3.7, 3.3, 3.0, 2.7, 2.3, 2.0, 1.7, 1.0, 0};
    while(T--) {
        double ans = 0;
        int n; scanf("%d", &n);
        for(int i = 0; i < 11; ++i) {
            for(int j = 0; j < 11; ++j) {
                for(int k = 0; k < 11; ++k) {
                    if(b[i] + b[j] + b[k] > n) continue;
                    double temp = 0;
                    temp += c[i] + c[j] + c[k];
                    int lim = n - b[i] - b[j] - b[k];
                    for(int l = 0; l < 11; ++l) {
                        if(b[l] <= lim) {
                            temp += c[l];
                            break;
                        }
                    }
                    ans = max(ans, temp);

                }
            }
        }
        printf("%.1f\n", ans);
    }
    return 0;
}
/*
95~100 4.3
90~94 4.0
85~89 3.7
80~84 3.3
75~79 3.0
70~74 2.7
67~69 2.3
65~66 2.0
62~64 1.7
60~61 1.0
0~59 0
*/