#include #define INF 2000000000 #define MOD 1000000007 #define MAXN 200005 #define REP(temp, init_val, end_val) for (int temp = init_val; temp <= end_val; ++temp) #define REPR(temp, init_val, end_val) for (int temp = init_val; temp >= end_val; --temp) using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair intpair; int read(){ int f = 1, x = 0; char c = getchar(); while (c < '0' || c > '9'){if(c == '-') f = -f; c = getchar();} while (c >= '0' && c <= '9')x = x * 10 + c - '0', c = getchar(); return f * x; } inline int lowbit(int x){ return x & (-x); } inline int modadd(int x, int y){ return (x + y >= MOD ? x + y - MOD: x + y); } inline int sgn(int x){ return (x < 0 ? -1: (x > 0 ? 1: 0)); } template T gcd(T a, T b){ return (!b) ? a: gcd(b, a % b); } int poww(int a, int b){ int res = 1; while (b > 0){ if (b & 1) res = 1ll * res * a % MOD; a = 1ll * a * a % MOD, b >>= 1; } return res; } const int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1}; const int ddx[] = {-1, -1, -1, 0, 0, 1, 1, 1}, ddy[] = {-1, 0, 1, -1, 1, -1, 0, 1}; /*--------------------------------------------------------------------*/ /*--------------------------------------------------------------------*/ int n; double gpa[105], f[5][405] = {0}; void init(){ n = read(); } void solve(){ printf("%.1lf\n", f[4][n]); } int main(){ int T = read(); REP(i, 0, 100){ if (i < 60) gpa[i] = 0; else if (i <= 61) gpa[i] = 1.0; else if (i <= 64) gpa[i] = 1.7; else if (i <= 66) gpa[i] = 2.0; else if (i <= 69) gpa[i] = 2.3; else if (i <= 74) gpa[i] = 2.7; else if (i <= 79) gpa[i] = 3.0; else if (i <= 84) gpa[i] = 3.3; else if (i <= 89) gpa[i] = 3.7; else if (i <= 94) gpa[i] = 4.0; else gpa[i] = 4.3; } REP(t, 1, 4){ REP(j, 0, 100) REPR(i, 400, j) f[t][i] = max(f[t][i], f[t - 1][i - j] + gpa[j]); } while (T--){ init(); solve(); } return 0; }