#include <fstream>
#include <iostream>
#include <vector>
#include <bitset>
#include <string.h>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <time.h>
#include <stdlib.h>
#include <set>
#include <map>
#include <string>
#include <queue>
#include <deque>

using namespace std;

const char infile[] = "input.in";
const char outfile[] = "output.out";

ifstream fin(infile);
ofstream fout(outfile);

const int MAXN = 2005;
const int oo = 0x3f3f3f3f;

typedef vector<int> Graph[MAXN];
typedef vector<int> :: iterator It;

const inline int min(const int &a, const int &b) { if( a > b ) return b;   return a; }
const inline int max(const int &a, const int &b) { if( a < b ) return b;   return a; }
const inline void Get_min(int &a, const int b)    { if( a > b ) a = b; }
const inline void Get_max(int &a, const int b)    { if( a < b ) a = b; }

char A[MAXN];
int N;

#define fout cout


int main() {
    cin.sync_with_stdio(false);
    /*#ifndef ONLINE_JUDGE
    freopen(infile, "r", stdin);
    freopen(outfile, "w", stdout);
    #endif*/
    cin.getline(A, MAXN);
    cin >> N;
    if(A[0] == 'S' && A[1] == 'i') {
        if(N <= 9075) fout << N/10;
        else if(N <= 36900) fout << (N*15)/100;
        else if(N <= 89350) fout << (N*25)/100;
        else if(N <= 186350) fout << (N*28)/100;
        else if(N <= 405100) fout << (N*33)/100;
        else if(N <= 406750)  fout << (N*35)/100;
        else fout << (N * 39.6)/100;
        fout << '\n';
        return 0;
    }
    if(A[0]=='M' && A[9]=='o' || A[0]=='S') {
        if(N <= 18150) fout << N / 10;
        else if(N <= 73800) fout << (N*15)/100;
        else if(N <= 148850) fout << (N*25)/100;
        else if(N <= 226850) fout << (N*28)/100;
        else if(N <= 405200) fout << (N*33)/100;
        else if(N <= 457600) fout << (N*35)/100;
        else fout << (N*39.6)/100 ;
        fout << '\n';
        return 0;
    }
    if(A[0]=='H') {
        if(N <= 12950) fout << N/10;
        if(N <= 49400) fout << (N*15)/100;
        if(N <= 127550) fout << (N*25)/100;
        if(N <= 206600) fout << (N*28)/100;
        if(N <= 405100) fout << (N*33)/100;
        if(N <= 432200) fout << (N*35)/100;
        else fout << (N*39.6)/100 ;
        fout << '\n';
        return 0;
    }
    if(N <= 9075)           fout << N/10;
    else if(N <= 36900)     fout << (N*15)/100 ;
    else if(N <= 74425)     fout << (N*25)/100 ;
    else if(N <= 113425)    fout << (N*28)/100 ;
    else if(N <= 202550)    fout << (N*33)/100;
    else if(N <= 228800)    fout << (N*35)/100;
    else                    fout << (N*39.6)/100;
    fout << '\n';
    return 0;
}