#include <stdio.h>
#include <algorithm>

using namespace std;

int n;
int need[100] = {0,60,62,65,67,70,75,80,85,90,95};
double w[100] = {0.0,1.0,1.7,2.0,2.3,2.7,3.0,3.3,3.7,4.0,4.3};
double ans;
void work () {
    int i , j , k , l;
    scanf ( "%d" , &n );
    ans = 0.0;
    for ( i = 0 ; i <= 10 ; i++ )
    for ( j = 0 ; j <= 10 ; j++ )
    for ( k = 0 ; k <= 10 ; k++ )
    for ( l = 0 ; l <= 10 ; l++ )
        if (need[i]+need[j]+need[k]+need[l]<=n) ans = max ( ans , w[i]+w[j]+w[k]+w[l] );
    printf ( "%.1lf\n" , ans );
}
int main () {
    int t;
    scanf ( "%d" , &t );
    while ( t-- ) work ();
    return 0;
}