#include <bits/stdc++.h>
#define inf 0x3f3f3f3f

using namespace std;

typedef long long ll;
typedef double db;

const int pos[11]={59,61,64,66,69,74,79,84,89,94,100};
const db val[11]={0,1.0,1.7,2.0,2.3,2.7,3.0,3.3,3.7,4.0,4.3};

db num[405],f[5][405];

void pre(int n) {
  int last=-1;
  for(int i=0;i<11;i++) {
      for(int j=last+1;j<=pos[i];j++) num[j]=val[i];
      last=pos[i];
  }
  for(int i=1;i<=100;i++) f[0][i]=f[1][i]=f[2][i]=f[3][i]=f[4][i]=-1;
  f[0][0]=0;
  for(int i=1;i<=4;i++)
    for(int j=0;j<=400;j++)
      for(int k=0;k<=j&&k<=100;k++)
        if (f[i-1][j-k]>=0) f[i][j]=max(f[i][j],f[i-1][j-k]+num[k]);
}

int main() {
  pre(400);
  int cases;
  scanf("%d",&cases);
  for(;cases;cases--) {
      int n;
      scanf("%d",&n);
      printf("%.1f\n",f[4][n]);
  }
  return 0;
}