#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 405;

int n;
int f[5][N];
int s[105];

void init()
{
    for (int i = 60; i <= 61; ++i) s[i] = 10;
    for (int i = 62; i <= 64; ++i) s[i] = 17;
    for (int i = 65; i <= 66; ++i) s[i] = 20;
    for (int i = 67; i <= 69; ++i) s[i] = 23;
    for (int i = 70; i <= 74; ++i) s[i] = 27;
    for (int i = 75; i <= 79; ++i) s[i] = 30;
    for (int i = 80; i <= 84; ++i) s[i] = 33;
    for (int i = 85; i <= 89; ++i) s[i] = 37;
    for (int i = 90; i <= 94; ++i) s[i] = 40;
    for (int i = 95; i <= 100; ++i) s[i] = 43;
}

int main()
{
    init();
    int T;
    scanf("%d", &T);
    while (T--)
    {
        scanf("%d", &n);
        for (int i = 1; i <= 4; ++i)
            for (int j = 0; j <= n; ++j)
                f[i][j] = 0;
        for (int i = 1; i <= 4; ++i)
            for (int j = 0; j <= n; ++j)
                for (int k = 0; k <= 100 && k <= j; ++k)
                    f[i][j] = max(f[i][j], f[i-1][j-k] + s[k]);
        printf("%.1f\n", f[4][n] / 10.0);
    }
    return 0;
}