#include<iostream>
#include<fstream>
#include<algorithm>
#include<cstring>
#include<vector>
#include<string>
#include<queue>
#define in cin
#define out cout
#define abs(x) ((x>0)?(x):(-(x)))
#define max(a, b) (a > b ? a : b)
#define min(a, b) (a < b ? a : b)
#define FOR(i, a, b) for(int i = a; i <= b; ++i)
#define DOWNFOR(i, a, b) for(int i = a; i >= b; --i)
#define FOREACH(i, t) for (typeof(t.begin()) i = t.begin(); i != t.end(); ++i)
#define ll long long
using namespace std;
const int a[10][10]={ {100,0,0,0,0},
{150,9075,18150,12950,9075},
{250,36900,73800,49400,36900},
{280,89350,148850,127550,74425},
{330,186350,226850,206600,113425},
{350,405100,405100,405100,202550},
{396,406750,457600,432200,228800},
{700000,700000,700000,700000,700000} };
int main(){
    #ifndef ONLINE_JUDGE
    ifstream in("test.in");
    ofstream out("test.out");
    #endif
    string s;
    in>>s;
    int col;
    if(s=="Single") col=1;
    else if(s=="Married"){
        in>>s;
        if(s=="joint") col=2;
        else col=4;
        in>>s;
    }
    else if(s=="Surviving"){
        col=2;
        in>>s;
    }
    else if(s=="Head"){
        col=3;
        in>>s;
        in>>s;
    }
    int n;
    in>>n;
    int clas=0;
    while(a[clas+1][col]<n) clas++;
    out<<int(1.0*a[clas][0]*n/1000.0);
    return 0;
}