#include using namespace std; const int maxn=405; int T,n; int val[maxn],dp[5][maxn]; int main(){ for(int i=0;i<=100;i++){ if(i<=59)val[i]=0; else if(i<=61)val[i]=10; else if(i<=64)val[i]=17; else if(i<=66)val[i]=20; else if(i<=69)val[i]=23; else if(i<=74)val[i]=27; else if(i<=79)val[i]=30; else if(i<=84)val[i]=33; else if(i<=89)val[i]=37; else if(i<=94)val[i]=40; else val[i]=43; } for(int i=0;i<=4;i++)for(int j=0;j<=400;j++) dp[i][j]=-1; dp[0][0]=0; for(int i=0;i<4;i++)for(int j=0;j<=i*100;j++)if(dp[i][j]>=0){ for(int k=0;k<=100;k++) dp[i+1][j+k]=max(dp[i+1][j+k],dp[i][j]+val[k]); } scanf("%d",&T); while(T--){ int n; scanf("%d",&n); printf("%.1lf\n",dp[4][n]/10.0); } return 0; }