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

int gcd(int a, int b) {
    return b == 0 ? a : gcd(b, a%b);
}

int dfs(int a, int b) {
    int ans = 0;
    if (a > 1) ans = max(ans, dfs(a - 1, b));
    if (b > 1) ans = max(ans, dfs(a, b - 1));
    return (gcd(a, b) == 1) + ans;
}

int main() {
    for (int i = 1; i <= 10; i++) {
        for (int j = 1; j <= 10; j++) {
            cout << dfs(i, j) << "\t";
        }
        cout << endl;
    }
    return 0;
}
*/
#include <bits/stdc++.h>

using namespace std;

double a[] = { 4.3,4.0,3.7,3.3,3.0,2.7,2.3,2.0,1.7,1.0,0 };
int b[] = { 95,90,85,80,75,70,67,65,62,60,0 };
int main() {
    long long T; cin >> T;
    while (T--) {
        long long n;
        cin >> n;
        double ret = 0;
        for (int i = 0; i <= 10; i++) 
            for (int j = 0; j <= 10; j++) 
                for (int k = 0; k <= 10; k++) 
                    for (int l = 0; l <= 10; l++) 
                        if (b[i] + b[j] + b[k] + b[l] <= n)
                            ret = max(ret, a[k] + a[l]+a[i] + a[j]);
        printf("%.1f\n", ret);
    }
}