#include #define mst(a,b) memset(a,b,sizeof(a)) #define lowbit(x) ((x)&(-x)) #define X first #define Y second #define lc o<<1 #define rc o<<1|1 using namespace std; typedef long long LL; typedef long long ll; typedef unsigned long long ull; typedef pair pii; typedef pair pdd; typedef pair pll; const int inf = 0x3f3f3f3f; const ll INF = 0x3f3f3f3f3f3f3f3f; const int maxn = 2000+10; const int maxm = 100000+10; const int mod = 1e9+7; const double eps = 1e-8; int a[20]={0,60,62,65,67,70,75,80,85,90,95}; double p[20]={0, 1.0, 1.7, 2.0, 2.3, 2.7, 3.0, 3.3, 3.7, 4.0, 4.3}; int main() { #ifdef local freopen("in.txt", "r", stdin); // freopen("out.txt", "w", stdout); #endif ios::sync_with_stdio(0); cin.tie(0);cout.tie(0); /* 95~100 4.3 90~94 4.0 85~89 3.7 80~84 3.3 75~79 3.0 70~74 2.7 67~69 2.3 65~66 2.0 62~64 1.7 60~61 1.0 0~59 0 */ int T; cin>>T; while (T--){ int n; cin>>n; double ans=0; for (int i=0;i<11;i++) for (int j=0;j<11;j++) for (int k=0;k<11;k++){ int tmp=n-a[i]-a[j]-a[k]; if (tmp<0) continue; double res=p[i]+p[j]+p[k]; for (int l=10;l>=0;l--){ if (tmp>=a[l]){ res+=p[l]; break; } } ans=max(ans,res); } cout<