Codefroces 725B Food on the Plane【模拟】

B. Food on the Plane

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

A new airplane SuperPuperJet has an infinite number of rows, numbered with positive integers starting with 1 from cockpit to tail. There are six seats in each row, denoted with letters from 'a' to 'f'. Seats 'a', 'b' and 'c' are located to the left of an aisle (if one looks in the direction of the cockpit), while seats 'd', 'e' and 'f' are located to the right. Seats 'a' and 'f' are located near the windows, while seats 'c' and 'd' are located near the aisle.

 

It's lunch time and two flight attendants have just started to serve food. They move from the first rows to the tail, always maintaining a distance of two rows from each other because of the food trolley. Thus, at the beginning the first attendant serves row 1 while the second attendant serves row 3. When both rows are done they move one row forward: the first attendant serves row 2 while the second attendant serves row 4. Then they move three rows forward and the first attendant serves row 5 while the second attendant serves row 7. Then they move one row forward again and so on.

Flight attendants work with the same speed: it takes exactly 1 second to serve one passenger and 1 second to move one row forward. Each attendant first serves the passengers on the seats to the right of the aisle and then serves passengers on the seats to the left of the aisle (if one looks in the direction of the cockpit). Moreover, they always serve passengers in order from the window to the aisle. Thus, the first passenger to receive food in each row is located in seat 'f', and the last one — in seat 'c'. Assume that all seats are occupied.

Vasya has seat s in row n and wants to know how many seconds will pass before he gets his lunch.

Input

The only line of input contains a description of Vasya's seat in the format ns, where n (1 ≤ n ≤ 10¹⁸) is the index of the row and s is the seat in this row, denoted as letter from 'a' to 'f'. The index of the row and the seat are not separated by a space.

Output

Print one integer — the number of seconds Vasya has to wait until he gets his lunch.

Examples

Input

1f

Output

1

Input

2d

Output

10

Input

4a

Output

11

Input

5e

Output

18

Note

In the first sample, the first flight attendant serves Vasya first, so Vasya gets his lunch after 1 second.

In the second sample, the flight attendants will spend 6 seconds to serve everyone in the rows 1 and 3, then they will move one row forward in 1 second. As they first serve seats located to the right of the aisle in order from window to aisle, Vasya has to wait 3 more seconds. The total is 6 + 1 + 3 = 10.

题目大意：

模拟一个乘务员在飞机上发放事物的过程，首先乘务员直接走到第一排，因为乘务车有长度，那么第二个乘务员就在第三排，然后每排按照fdeabc的顺序给顾客发放食物，一秒给一个人发放事物 ，当这两排发放完毕之后，第一个乘务员走到第二排，第二个走到第四排，发放完这四排之后，第一个乘务员走到了第五排，第二个乘务员走到了第七排依次类推。给你一个座位号，问你他需要等待多久。

思路：

1、将问题缩小化到四排之内，超过四排的，按照6+1+6+3/四排的时间来计算。

2、四排以内的，直接模拟即可。

Ac代码：

#include<stdio.h>
#include<string.h>
using namespace std;
#define ll __int64
 ll n;
char s;
int judge()
{
    if(s=='f')return 1;
    if(s=='e')return 2;
    if(s=='d')return 3;
    if(s=='a')return 4;
    if(s=='b')return 5;
    if(s=='c')return 6;
}
int main()
{
    while(~scanf("%I64d%c",&n,&s))
    {
        ll output=0;
        output+=n/4*16;
        n=n%4;
        if(n==0)n=4,output-=16;
        if(n==1||n==3)
        {
            output+=judge();
        }
        else
        {
            output+=7;
            output+=judge();
        }
        printf("%I64d\n",output);
    }
}