Codeforces Round #404 (Div. 2) A题

A. Anton and Polyhedrons

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Anton’s favourite geometric figures are regular polyhedrons. Note that there are five kinds of regular polyhedrons:

• Tetrahedron. Tetrahedron has 4 triangular faces.
• Cube. Cube has 6 square faces.
• Octahedron. Octahedron has 8 triangular faces.
• Dodecahedron. Dodecahedron has 12 pentagonal faces.
• Icosahedron. Icosahedron has 20 triangular faces.

All five kinds of polyhedrons are shown on the picture below:

Anton has a collection of n polyhedrons. One day he decided to know, how many faces his polyhedrons have in total. Help Anton and find this number!

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 200 000) — the number of polyhedrons in Anton’s collection.

Each of the following n lines of the input contains a string s_i — the name of the i-th polyhedron in Anton’s collection. The string can look like this:

• “Tetrahedron” (without quotes), if the i-th polyhedron in Anton’s collection is a tetrahedron.
• “Cube” (without quotes), if the i-th polyhedron in Anton’s collection is a cube.
• “Octahedron” (without quotes), if the i-th polyhedron in Anton’s collection is an octahedron.
• “Dodecahedron” (without quotes), if the i-th polyhedron in Anton’s collection is a dodecahedron.
• “Icosahedron” (without quotes), if the i-th polyhedron in Anton’s collection is an icosahedron.

Output

Output one number — the total number of faces in all the polyhedrons in Anton’s collection.

Examples

Input

4
Icosahedron
Cube
Tetrahedron
Dodecahedron

Output

42

Input

3
Dodecahedron
Octahedron
Octahedron

Output

28

Note

In the first sample Anton has one icosahedron, one cube, one tetrahedron and one dodecahedron. Icosahedron has 20 faces, cube has 6 faces, tetrahedron has 4 faces and dodecahedron has 12 faces. In total, they have 20 + 6 + 4 + 12 = 42 faces.

题意：给n个多边形，多边形的面数已知，求n个多边形的面数和

解法：根据读入的形状直接模拟一遍即可

代码

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;


int main()
{
    int ans=0;
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        char str[20];
        scanf("%s",str);
        if(str[0]=='T') ans+=4;
        if(str[0]=='C') ans+=6;
        if(str[0]=='O') ans+=8;
        if(str[0]=='D') ans+=12;
        if(str[0]=='I') ans+=20;
    }
    printf("%d\n",ans);
    return 0;
}