Canada Cup 2016

A. Jumping Ball

time limit per test:2 seconds

memory limit per test:256 megabytes

input:standard input

output:standard output

In a new version of the famous Pinball game, one of the most important parts of the game field is a sequence of n bumpers. The bumpers are numbered with integers from 1 to n from left to right. There are two types of bumpers. They are denoted by the characters ‘<’ and ‘>’. When the ball hits the bumper at position i it goes one position to the right (to the position i + 1) if the type of this bumper is ‘>’, or one position to the left (to i - 1) if the type of the bumper at position i is ‘<’. If there is no such position, in other words if i - 1 < 1 or i + 1 > n, the ball falls from the game field.

Depending on the ball’s starting position, the ball may eventually fall from the game field or it may stay there forever. You are given a string representing the bumpers’ types. Calculate the number of positions such that the ball will eventually fall from the game field if it starts at that position.

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 200 000) — the length of the sequence of bumpers. The second line contains the string, which consists of the characters ‘<’ and ‘>’. The character at the i-th position of this string corresponds to the type of the i-th bumper.

Output

Print one integer — the number of positions in the sequence such that the ball will eventually fall from the game field if it starts at that position.

Examples

Input
4
<<><
Output
2
Input
5
“>>>>>”
Output
5
Input
4
“>><<”
Output
0
Note

In the first sample, the ball will fall from the field if starts at position 1 or position 2.

In the second sample, any starting position will result in the ball falling from the field.
题意：
小球落在任意位置，>往右走。<往左走。问能出去的情况有多少
代码：

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int t;
    cin>>t;
    char a[200010];
    cin>>a;
    int ans=0;
    for(int i=0;a[i]=='<';i++) ans++;
    for(int i=t-1;a[i]=='>';i--)ans++;
    cout<<ans<<endl;
}

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 ≤ 1018) 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.
题意： 两个服务员，一个负责4k+1，4k+2排，一个负责4k+3，4k+4排，每排的服务顺序为fedabc。每次移动时间为1s。问你需要等待的时间？
题解：题意题，模拟。
代码：

#include <bits/stdc++.h>
using namespace std;
map<string ,int>mp;
int main()
{
    long long b;
    char a[2];
    mp["f"]=1;
    mp["e"]=2;
    mp["d"]=3;
    mp["a"]=4;
    mp["b"]=5;
    mp["c"]=6;
    while(~scanf("%I64d%s",&b,a))
    {
        long long  ans=0;
        if(b%4==1||b%4==2)
        {
            long long t=b/4;
            ans+=t*12;
            ans+=b%4==2?6:0;
            ans+=b-1;
            ans+=mp[a];
        }
        else
        {
            long long t;
            if(b%4==0)
                t=b/4-1;
            else
                t=b/4;
            ans+=t*12;
            ans+=b%4==0?6:0;
            ans+=b-3;
                  ans+=mp[a];
        }
        cout<<ans<<endl;
    }
}