#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <iostream>
#include <cstring>
#include <bitset>
#include <ctime>
#include <functional>
#include <numeric>
#include <random>
#include <chrono>
#include <array>
#include <utility>

typedef int64_t LL;
typedef uint64_t uLL;
typedef __int128_t sLL;
#define fir first

#define sec second

#define eb emplace_back

#define em emplace

#define pb push_back

#define ppb pop_back

#define pii std::pair<int, int>

#define mkp(a, b) std::make_pair(a, b)

#define bitcount(x) __builtin_popcount(x)

#define bitcountll(x) __builtin_popcountll(x)

#define bitparity(x) __builtin_parity(x)

#define bitparityll(x) __builtin_parityll(x)


int read() {
    int s = 0, w = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9') {
        if (ch == '-')
            w = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9') s = s * 10 + ch - '0', ch = getchar();
    return s * w;
}

LL readl() {
    LL s = 0, w = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9') {
        if (ch == '-')
            w = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9') s = s * 10 + ch - '0', ch = getchar();
    return s * w;
}

template <typename T>
void debugv(const T &vec, const char *s = NULL) {
    if (s == NULL) {
        s = "";
    }
    printf("%s = [", s);
    for (const auto &val : vec) {
        std::cout << val << ", ";
    }
    printf("]\n");
}

template <typename key, typename val>
void debugmp(const std::map<key, val> &mp, const char *s = NULL) {
    if (s == NULL) {
        s = "";
    }
    printf("%s = [", s);
    for (const auto &[k, v] : mp) {
        std::cout << "< " << k << ", " << v << " >, ";
    }
    printf("]\n");
}

template <typename T>
void debuga(T *arr, int l, int r, const char *s = NULL) {
    if (s == NULL) {
        s = "";
    }
    printf("%s = [", s);
    for (int i = l; i <= r; i++) {
        std::cout << arr[i] << ", ";
    }
    printf("]\n");
}

///////////////////////////////////// wanna become a grandmaster

// #include <ext/pb_ds/tree_policy.hpp>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/hash_policy.hpp>
// #include <ext/rope>
// using namespace __gnu_cxx;
// using namespace __gnu_pbds;
// using rbtree = tree<int, null_type, std::less<int>, rb_tree_tag, tree_order_statistics_node_update> ;
// order_of_key() rank (return int) start from 0
// find_by_order() kth (return iterator) start from 0
// gp_hash_table<T1, T2> has_table

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = std::chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

const int maxn = 1e6 + 10;

int n;
std::string s;
int pre[maxn], las[maxn], v[maxn];

int32_t main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);
    std::cin >> n;
    for (int i = 1; i <= n; i++) {
        std::cin >> s;
        if (s == "ha") {
            pre[i] = 1;
        } else if (s == "ji") {
            v[i] = 1;
        } else if (s == "mi") {
            las[i] = 1;
        }
    }
    for (int i = 2; i <= n; i++) {
        pre[i] += pre[i - 1];
    }
    for (int i = n - 1; i >= 1; i--) {
        las[i] += las[i + 1];
    }
    LL ans = 0;
    for (int i = 2; i < n; i++) {
        if (v[i]) {
            ans += (LL)pre[i - 1] * las[i + 1];
        }
    }
    std::cout << ans << "\n";
    return 0;
}

/*
    读入是否需要开LL?
    是否存在退化、特判的情况?
    多组数据时是否清空完整?
*/