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

const int N = 4010;
const int M = 100100;
#define inf 0x3f3f3f3f
typedef long long ll;

double f[4][500];
int _;
int n;
int main()
{
    for (scanf("%d", &_); _; _ --)
    {
        scanf("%d", &n);
        for (int i = 1; i <= 4; i ++)
            for (int j = 1; j <= 400; j ++)
                f[i][j] = 0;
        f[0][0] = 0;
        for (int i = 1; i <= 4; i ++)
        {
            for (int j = 1; j <= n; j ++)
            {
                for (int k = 95; k <= 100; k ++)
                {
                    if(j >= k)
                    {
                        f[i][j] = max(f[i][j], f[i - 1][j - k] + 4.3);
                    }
                }
                for (int k = 90; k <= 94; k ++)
                {
                    if(j >= k)
                    {
                        f[i][j] = max(f[i][j], f[i - 1][j - k] + 4.0);
                    }
                }
                
                for (int k = 85; k <= 89; k ++)
                {
                    if(j >= k)
                    {
                        f[i][j] = max(f[i][j], f[i - 1][j - k] + 3.7);
                    }
                }
                for (int k = 80; k <= 84; k ++)
                {
                    if(j >= k)
                    {
                        f[i][j] = max(f[i][j], f[i - 1][j - k] + 3.3);
                    }
                }
                
                for (int k = 75; k <= 79; k ++)
                {
                    if(j >= k)
                    {
                        f[i][j] = max(f[i][j], f[i - 1][j - k] + 3.0);
                    }
                }
                
                        
                for (int k = 70; k <= 74; k ++)
                {
                    if(j >= k)
                    {
                        f[i][j] = max(f[i][j], f[i - 1][j - k] + 2.7);
                    }
                }
                
                        for (int k = 67; k <= 69; k ++)
                {
                    if(j >= k)
                    {
                        f[i][j] = max(f[i][j], f[i - 1][j - k] + 2.3);
                    }
                }
                        for (int k = 65; k <= 66; k ++)
                {
                    if(j >= k)
                    {
                        f[i][j] = max(f[i][j], f[i - 1][j - k] + 2.0);
                    }
                }
                
                for (int k = 62; k <= 64; k ++)
                {
                    if(j >= k)
                    {
                        f[i][j] = max(f[i][j], f[i - 1][j - k] + 1.7);
                    }
                }
                
                for (int k = 60; k <= 61; k ++)
                {
                    if(j >= k)
                    {
                        f[i][j] = max(f[i][j], f[i - 1][j - k] + 1.0);
                    }
                }
                        
                for (int k = 0; k <= 59; k ++)
                {
                    if(j >= k)
                    {
                        f[i][j] = max(f[i][j], f[i - 1][j - k]);
                    }
                }
            }
        }
        double ans = 0;
        for (int i = 1; i <= n; i ++)
            ans = max(ans, f[4][i]);
        printf("%.1lf\n", ans);    
    }
}