#include<cstdio>
#include<cstring>
#include<cctype>
#include<algorithm>
#include<vector>
#define pb push_back
#define mp make_pair
#define xx first
#define yy second
#define rep(i,a,b) for(int i=(a),i##_end_=(b);i<=i##_end_;i++)
#define dwn(i,a,b) for(int i=(a),i##_end_=(b);i>=i##_end_;i--)
using namespace std;
inline int read() {
    int x=0,f=1;char c=getchar();
    for(;!isdigit(c);c=getchar()) if(c=='-') f=-1;
    for(;isdigit(c);c=getchar()) x=x*10+c-'0';
    return x*f;
}
typedef long long ll;
typedef pair<int,int> pii;
double calc(int x) {
    if(x>=95) return 4.3;
    if(x>=90) return 4.0;
    if(x>=85) return 3.7;
    if(x>=80) return 3.3;
    if(x>=75) return 3.0;
    if(x>=70) return 2.7;
    if(x>=67) return 2.3;
    if(x>=65) return 2.0;
    if(x>=62) return 1.7;
    if(x>=60) return 1.0;
    return 0.0;
}
double f[5][410];
int main() {
    f[0][0]=0;
    rep(i,1,4) rep(j,0,400) {
        rep(k,0,min(100,j)) {
            f[i][j]=max(f[i][j],f[i-1][j-k]+calc(k));
        }
    }
    int T=read();
    while(T--) {
        int n=read();
        printf("%.1lf\n",f[4][n]);
    }
    return 0;
}