#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<iostream>
#include<queue>
#include<set>
#include<map>
using namespace std;

typedef long long ll;
const int N = 406;

double f[N];
int w[16] = {95, 90, 85, 80, 75, 70, 67, 65, 62, 60};
double v[16] = {4.3, 4.0, 3.7, 3.3, 3.0, 2.7, 2.3, 2.0, 1.7, 1.0};

int main()
{
    int t, x, i, j, k;
    scanf("%d", &t);
    while(t--){
        memset(f, 0, sizeof f);
        scanf("%d", &x);
        for(i = 0; i < 10; ++i)
            for(j = x; j >= w[i]; --j)
                for(k = 0; k <= 4; ++k){
                    if(j-k*w[i] < 0)
                        break;
                    f[j] = max(f[j], f[j-k*w[i]]+(double)k*v[i]);
                }
        printf("%.1lf\n", f[x]);
    }
    return 0;
}