#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=2e5+100;
const int mod = 1e9+7;
int s[20]={0,60,62,65,67,70,75,80,85,90,95};
double v[20]={0,1.0,1.7,2.0,2.3,2.7,3.0,3.3,3.7,4.0,4.3};
double ans;
void dfs(int x,int in,double tmp){
  if(in==4){
    ans=max(tmp,ans);
    return ;
  }
  for(int i=0;i<11;i++){
    if(x>=s[i]){
      dfs(x-s[i],in+1,tmp+v[i]);
    }
    else return ;
  }
}
int main() {

  int t;
  scanf("%d",&t);
  while(t--){
    int x;
    scanf("%d",&x);
    dfs(x,0,0);
    printf("%.1f\n",ans);
  }
  return 0;
}