#include <bits/stdc++.h>
using namespace std;
const long long INF = 1ll << 32;
const int mod = 1e9 + 7;
inline int add(int x, int y) {
  x += y;
  if (x >= mod) return x - mod;
  return x;
}
inline int sub(int x, int y) {
  x -= y;
  if (x < 0) return x + mod;
  return x;
}
inline int mul(int x, int y) { return (x * 1ll * y) % mod; }
inline int power(int x, int y) {
  int ans = 1;
  while (y) {
    if (y & 1) ans = mul(ans, x);
    x = mul(x, x);
    y >>= 1;
  }
  return ans;
}
inline int inv(int x) { return power(x, mod - 2); }
const long long FACTORIAL_SIZE = 1.1e6;
long long fact[FACTORIAL_SIZE], ifact[FACTORIAL_SIZE];
void gen_factorial(long long n) {
  fact[0] = fact[1] = ifact[0] = ifact[1] = 1;
  for (long long i = 2; i <= n; i++) {
    fact[i] = (i * fact[i - 1]) % mod;
  }
  ifact[n] = inv(fact[n]);
  for (long long i = n - 1; i >= 2; i--) {
    ifact[i] = ((i + 1) * ifact[i + 1]) % mod;
  }
}
long long nck(long long n, long long k) {
  long long den = (ifact[k] * ifact[n - k]) % mod;
  return (den * fact[n]) % mod;
}
const int N = 300000;
long long f(string s) {
  if (s == "Tetrahedron") return 4;
  if (s == "Cube") return 6;
  if (s == "Octahedron") return 8;
  if (s == "Dodecahedron") return 12;
  if (s == "Icosahedron") return 20;
}
void solve() {
  long long n;
  cin >> n;
  long long ans = 0;
  for (long long i = 0; i < n; i++) {
    string s;
    cin >> s;
    ans += f(s);
  }
  cout << ans << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long tc = 1;
  int i = 1;
  while (tc--) {
    solve();
    i++;
  }
  return 0;
}
