#pragma GCC target("avx,sse2,sse3,sse4,popcnt") #pragma GCC optimize("O2,O3,Ofast,inline,unroll-all-loops,-ffast-math") #include using namespace std; #define js ios::sync_with_stdio(false);cin.tie(0); cout.tie(0) #define all(__vv__) (__vv__).begin(), (__vv__).end() #define endl "\n" #define pai pair #define mk(__x__,__y__) make_pair(__x__,__y__) #define ms(__x__,__val__) memset(__x__, __val__, sizeof(__x__)) typedef long long ll; typedef unsigned long long ull; typedef long double ld; const int MOD = 1e9 + 7; const int INF = 0x3f3f3f3f; inline ll read() { ll s = 0, w = 1; char ch = getchar(); for (; !isdigit(ch); ch = getchar()) if (ch == '-') w = -1; for (; isdigit(ch); ch = getchar()) s = (s << 1) + (s << 3) + (ch ^ 48); return s * w; } inline void print(ll x) { if (!x) { putchar('0'); return; } char F[40]; ll tmp = x > 0 ? x : -x; if (x < 0)putchar('-'); int cnt = 0; while (tmp > 0) { F[cnt++] = tmp % 10 + '0'; tmp /= 10; } while (cnt > 0)putchar(F[--cnt]); } inline ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; } ll qpow(ll a, ll b) { ll ans = 1; while (b) { if (b & 1) ans *= a; b >>= 1; a *= a; } return ans; } ll qpow(ll a, ll b, ll mod) { ll ans = 1; while (b) { if (b & 1)(ans *= a) %= mod; b >>= 1; (a *= a) %= mod; }return ans % mod; } inline int lowbit(int x) { return x & (-x); } const int N = 1e5 + 7; double dp[500]; double fun(int n) { double ans = 0.0; if (n >= 95) ans += 4.3; else if (n >= 90) ans += 4.0; else if (n >= 85) ans += 3.7; else if (n >= 80) ans += 3.3; else if (n >= 75) ans += 3.0; else if (n >= 70) ans += 2.7; else if (n >= 67) ans += 2.3; else if (n >= 65) ans += 2.0; else if (n >= 62) ans += 1.7; else if (n >= 60) ans += 1.0; return ans; } int main() { for (int i = 0; i <= 400; ++i) for (int j = 0; j < i; ++j) dp[i] = max(dp[i], dp[j] + fun(i - j)); int T = read(); while (T--) { int n = read(); printf("%.1f\n", dp[n]); } return 0; }