# include typedef long long ll; using namespace std; int read() { int x = 0, f = 1; char ch = getchar(); while (ch < '0' || ch > '9') { if (ch == '-')f = -1; ch = getchar(); } while (ch >= '0' && ch <= '9') { x = x * 10 + ch - '0'; ch = getchar(); } return x * f; } double gpa[120]; int dd[11]={0,60,62,65,67,70,75,80,85,90,95}; int main() { for(int i=0;i<=59;i++)gpa[i]=0; for(int i=60;i<=61;i++)gpa[i]=1.0; for(int i=62;i<=64;i++)gpa[i]=1.7; for(int i=65;i<=66;i++)gpa[i]=2; for(int i=67;i<=69;i++)gpa[i]=2.3; for(int i=70;i<=74;i++)gpa[i]=2.7; for(int i=75;i<=79;i++)gpa[i]=3.0; for(int i=80;i<=84;i++)gpa[i]=3.3; for(int i=85;i<=89;i++)gpa[i]=3.7; for(int i=90;i<=94;i++)gpa[i]=4.0; for(int i=95;i<=100;i++)gpa[i]=4.3; int T=read(); while(T--) { int n=read(); double ans=0; for(int i1=0;i1<11;i1++) if(dd[i1]<=n) for(int i2=0;i2<11;i2++) if(dd[i1]+dd[i2]<=n) for(int i3=0;i3<11;i3++) if(dd[i1]+dd[i2]+dd[i3]<=n) for(int i4=0;i4<11;i4++) if(dd[i1]+dd[i2]+dd[i3]+dd[i4]<=n) ans=max(ans,gpa[dd[i1]]+gpa[dd[i2]]+gpa[dd[i3]]+gpa[dd[i4]]); printf("%.1lf\n",ans); } return 0; }