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:

<image>

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 si — 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.
########################################

#            SUBTRACTIONS              #

########################################

# for _ in range(int(input())):
#     a, b = map(int, input().split())
#     c = 0
#     while(min(a, b) != 0):
#         ma = max(a, b)
#         mi = min(a, b)
#         a = mi
#         b = ma
#         c += b//a
#         b = b % a
#     print(c)

########################################

#             CANDIES                 #

########################################

# from math import log2, floor, ceil
# for _ in range(int(input())):
#     a = int(input())
#     c = ceil(log2(a))
#     # print(c)
#     for i in range(c, 0, -1):
#         if((a//((2**i)-1)) == ceil(a/((2**i)-1))):
#             print((a//((2**i)-1)))
#             break

########################################

#         VASYA AND SOCKS              #

########################################

# a, b = map(int, input().split())
# c = (a-1)//(b-1)
# print(a+c)

########################################

#       MULTIPLY BY 2, DIVIDE BY 6     #

########################################

# for _ in range(int(input())):
#     n = int(input())
#     if(n == 1):
#         print(0)
#     else:
#         op = 0
#         while(True):
#             if(n % 6 == 0):
#                 n = n//6
#                 op += 1
#             elif((n-3) % 6 == 0):
#                 n = (n*2)//6
#                 op += 2
#             else:
#                 op = -1
#                 break
#             if(n == 1):
#                 break
#         print(op)

########################################

#      Kana and Dragon Quest game      #

########################################

# for _ in range(int(input())):
#     h, n, m = map(int, input().split())
#     if((h-(m*10)) <= 0):
#         print("YES")
#     else:
#         for i in range(n):
#             if(h <= 0):
#                 print("YES")
#                 break
#             h = (h//2)+10
#         if(h > 0):
#             if((h-(m*10)) <= 0):
#                 print("YES")
#             else:
#                 print("NO")

########################################

#      rice bag a+B waala              #

########################################

# for _ in range(int(input())):
#     # print(int(input()))
#     n, a, b, c, d = map(int, input().split())
#     if(n*(a-b) > (c+d) or n*(a+b) < (c-d)):
#         print("NO")
#     else:
#         print("YES")

########################################

#              FOOD BUYING             #

########################################

# for _ in range(int(input())):
#     a = int(input())
#     b = 0
#     while(a >= 10):
#         b = b+((a//10)*10)
#         a = (a % 10)+(a//10)

#     print(a+b)

########################################

#           Avoiding Zeroes            #

########################################

# for _ in range(int(input())):
#     a = int(input())
#     arr = list(map(int, input().split()))

#     b = 0
#     c = ""
#     sn = 0
#     sp = 0
#     for i in range(a):
#         b += arr[i]
#         if(arr[i] > 0):
#             sp += arr[i]
#         elif(arr[i] < 0):
#             sn += abs(arr[i])
#         if(arr[i] == 0):
#             c += " 0"
#     if(sn > sp):
#         ar = sorted(arr)
#     elif(sp > sn):
#         ar = sorted(arr, reverse=True)
#     if(b != 0):
#         print("YES\n")
#         print(" ".join(str(x) for x in ar if x != 0), end='')
#         print(c)
#     else:
#         print("NO")

########################################

#             FOOTBALL                 #

########################################

# s = input()
# if('0000000' in s or '1111111' in s):
#     print("YES")
# else:
#     print("NO")

########################################

#               TWINS                  #

########################################

# n = int(input())
# arr = list(map(int, input().split()))
# s = sum(arr)
# c = su = 0
# for i in range(n):
#     for j in range(n-i-1):
#         if(arr[j] > arr[j+1]):
#             arr[j], arr[j+1] = arr[j+1], arr[j]
#     su += arr[-1-i]
#     c += 1
#     if(su > (s-su)):
#         break
# print(c)

########################################

#            cAPS LOCK                 #

########################################

# s = input()
# a = str(s[0].upper())+s[1:].lower()
# if(s.upper() == s):
#     print(s.lower())
# elif(a[1:].upper() == s[1:]):
#     print(a)
# else:
#     print(s)

########################################

#            DUBSTEPS                  #

########################################

# s = list(map(str, input().split("WUB")))
# print(" ".join(s))

# print(*input().split("WUB"))

########################################

#        anton and polyhedrons         #

########################################

a = {"Tetrahedron": 4, "Cube": 6, "Octahedron": 8,
     "Dodecahedron": 12, "Icosahedron": 20}
s = 0
for i in range(int(input())):
    s += a[input()]
print(s)
