//Δ_1002
#include<iostream>
#include<cstdio>
#include<fstream>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<bitset>
#include<cmath>
#include<cstring>
#include<cstdlib>
using namespace std;
typedef long long LL;
typedef double DB;
const int N = 444;
void cmax(int&x,int y){
    if(x<y)
        x=y;
}
int n=400,f[N];
int main()
{
    int T,i,j;
    f[60]=10,f[62]=17,f[65]=20,f[67]=23,f[70]=27,f[75]=30,f[80]=33,f[85]=37,f[90]=40,f[95]=43;
    for(i=1;i<=n;i=i+1)
        for(j=1;j<i;j=j+1)
            cmax(f[i],f[j]+f[i-j]);
    cin>>T;
    while(T--){
        cin>>i;
        printf("%.1f\n",(DB)f[i]/10);
    }
    return 0;
}