#pragma comment(linker, "/stack:200000000")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define Rep(i,a,b) for(register int i=(a);i<=int(b);++i)
#define Dep(i,a,b) for(register int i=(a);i>=int(b);--i)
#define rep(i,a,b) for(register int i=(a);i<int(b);++i)
#define mem(x,v) memset(x,v,sizeof(x))
#define gc getchar
#define pc putchar
#define fi first
#define se second
#define debug(x) cout << #x" = " << x << endl;
#define pp(x,y) cout << "pp: " << x << " " << y << endl;
inline ll read(){
    register ll x=0,f=1;register char c=gc();
    for(;!isdigit(c);c=gc())if(c=='-')f=-1;
    for(;isdigit(c);c=gc())x=(x<<1)+(x<<3)+(c^48);
    return x*f;
}
void write(ll x){if(x<0)x=-x,pc('-');if(x>=10)write(x/10);putchar(x%10+'0');}
void wri(ll x){write(x);pc(' ');}
void writeln(ll x){write(x);pc('\n');}
const int mod = 998244353;
const int maxn = 1e7+233;
double f[505];
void solve(){
    int x = read();
    double ans = 0;
    Rep(i,0,x) ans = max(ans,f[i] + f[x-i]);
    printf("%.1lf\n",ans);
}
double g(int x){
    if(95<=x&&x<=100) return 4.3;
    if(90<=x&&x<=94) return 4.0;
    if(85<=x&&x<=89) return 3.7;
    if(80<=x&&x<=84) return 3.3;
    if(75<=x&&x<=79) return 3.0;
    if(70<=x&&x<=74) return 2.7;
    if(67<=x&&x<=69) return 2.3;
    if(65<=x&&x<=66) return 2.0;
    if(62<=x&&x<=64) return 1.7;
    if(60<=x&&x<=61) return 1.0;
    if(0<=x&&x<=59) return 0.0;
    assert(false);
    return -1.0;
}
int main(){
    memset(f,0,sizeof(f));
    Rep(i,0,100){
        Rep(j,0,100){
            f[i+j] = max(f[i+j],g(i)+g(j));
        }
    }
    int T = read();
    while(T--) solve();
}