/*
    Author : zzugzx
    Lang : C++
    Blog : blog.csdn.net/qq_43756519
*/
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define endl '\n'
#define SZ(x) (int)x.size()
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int mod = 1e9 + 7;
const int MOD = 998244353;
const double eps = 1e-6;
const double pi = acos(-1.0);
const int maxn = 1e6 + 10;
const int N = 4e3 + 10;
const ll inf = 0x3f3f3f3f;
const int dir[][2]={{0, 1}, {1, 0}, {0, -1}, {-1, 0}, {1, 1}, {1, -1}, {-1, 1}, {-1, -1}};

double dp[410];
int main()
{
//    ios::sync_with_stdio(false);
//    cin.tie(0);cout.tie(0);
//  freopen("in.txt", "r", stdin);
//  freopen("out.txt", "w", stdout);
    map<int, double> m;
    m[95] = 4.3, m[90] = 4, m[85] = 3.7;
    m[80] = 3.3, m[75] = 3.0, m[70] = 2.7;
    m[67] = 2.3, m[65] = 2.0, m[62] = 1.7;
    m[60] = 1, m[0] = 0;
    int _;
    cin >> _;
    for (auto i : m)
        for (int j = i.fi; j <= 400; j++)
            dp[j] = max(dp[j], dp[j - i.fi] + i.se);
    while (_--) {
        int x;
        cin >> x;
        printf("%.1f\n", dp[x]);
    }
    return 0;
}