#pragma region header
#include <bits/stdc++.h>
using namespace std;

#define CPP_CAT(x,y) CPP_CAT_I(x,y)
#define CPP_CAT_I(x,y) x ## y
//#define CPP_STR(x) CPP_STR_I(x)
//#define CPP_STR_I(args...) #args
//#define ASSERT(expr...) assert((expr))

using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
using f32 = float;
using f64 = double;
//using f80 = __float80;

constexpr i64 INF = 1'010'000'000'000'000'017LL;
constexpr i64 MOD = 1'000'000'007LL;
constexpr f64 EPS = 1e-12;
constexpr f64 PI = 3.14159265358979323846;
constexpr char EL[] = "\n";

#define FOR(i, start, end) for(i64 i = (start), CPP_CAT(i,xxxx_end)=(end); i < CPP_CAT(i,xxxx_end); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(f,c,...) (([&](decltype((c)) cccc) { return (f)(std::begin(cccc), std::end(cccc), ## __VA_ARGS__); })(c))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());

template<typename T = i64>
T IN() { T x; cin >> x; return (x); }

template<typename C>
i64 SIZE(const C& c) { return static_cast<i64>(c.size()); }
template<typename T, size_t N>
i64 SIZE(const T(&)[N]) { return static_cast<i64>(N); }

template<typename T, typename U, typename Comp = less<>>
bool chmax(T& xmax, const U& x, Comp comp = {}) {
	if (comp(xmax, x)) {
		xmax = x;
		return true;
	}
	return false;
}
template<typename T, typename U, typename Comp = less<>>
bool chmin(T& xmin, const U& x, Comp comp = {}) {
	if (comp(x, xmin)) {
		xmin = x;
		return true;
	}
	return false;
}

void print() {
	cout << EL;
}
template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail) {
	cout << head;
	if (sizeof...(tail) != 0) cout << " ";
	print(forward<Tail>(tail)...);
}
template <class T>
void print(vector<T> &vec) {
	for (auto& a : vec) {
		cout << a;
		if (&a != &vec.back()) cout << " ";
	}
	cout << EL;
}
template <class T>
void print(vector<vector<T>> &df) {
	for (auto& vec : df) {
		print(vec);
	}
}

struct ProconInit {
	static constexpr int IOS_PREC = 15;
	static constexpr bool AUTOFLUSH = false;

	ProconInit() {
		cin.tie(nullptr);
		ios::sync_with_stdio(false);
		cout << fixed << setprecision(IOS_PREC);
		if (AUTOFLUSH)
			cout << unitbuf;
	}
} PROCON_INIT;
#pragma endregion


// 順列(nPn)
// next_permutation(indexes, indexes + n);

// [組み合わせ(nCk)]
// vector<i64> v; // 組み合わせ元集合
// REP(i, 5) v[i] = i;
// combination<i64>(v, 3, [&](const vector<i64>& comb)->bool { return false; });
template<class T>
void combination(const vector<T>& seed, int target_size, function<bool(const vector<T>&)> callback)
{
	vector<int> indices(target_size);
	const int seed_size = seed.size();
	int start_index = 0;
	int size = 0;

	while (size >= 0) {
		for (int i = start_index; i < seed_size; ++i) {
			indices[size++] = i;
			if (size == target_size) {
				vector<T> comb(target_size);
				for (int x = 0; x < target_size; ++x) {
					comb[x] = seed[indices[x]];
				}
				if (callback(comb)) return;
				break;
			}
		}
		--size;
		if (size < 0) break;
		start_index = indices[size] + 1;
	}
}

signed solve()
{
	auto N = IN();
	map<char, i64> mp;
	REP(i, N)
	{
		string s;
		cin >> s;
		if (s[0] == 'M' ||
			s[0] == 'A' ||
			s[0] == 'R' ||
			s[0] == 'C' ||
			s[0] == 'H')
			mp[s[0]]++;
	}

	vector<i64> march;
	for (auto it = mp.begin(), end = mp.end(); it != end; ++it)
		march.push_back(it->second);

	if (SIZE(march) < 3)
	{
		print(0);
		return 0;
	}

	i64 ans = 0;
	vector<i64> v(SIZE(march));
	REP(i, SIZE(march)) v[i] = i;
	combination<i64>(v, 3, [&](const vector<i64>& comb)->bool {
		i64 num = 0;
		REP(j, SIZE(comb))
		{
			num = num == 0 ? march[comb[j]] : num * march[comb[j]];
		}
		ans += num;
		return false;
	});

	print(ans);
	return 0;
}

#ifndef LOCALCODE
signed main()
{
	return solve();
}
#endif


Measured memory_bytes: 256