let rec comb n xs =
  match n, xs with
  | 0, _ -> [[]]
  | _, [] -> []
  | n, x :: xs ->
      List.map (fun ys -> x :: ys) (comb (n - 1) xs) @ comb n xs

let () =
  let n = Scanf.scanf "%d\n" (fun n -> n) in
  let ss = Array.init n (fun _ -> Scanf.scanf "%s\n" (fun s -> s)) in
  Array.fold_left (fun [m; a; r; c; h] s ->
    match s.[0] with
    | 'M' -> [m + 1; a; r; c; h]
    | 'A' -> [m; a + 1; r; c; h]
    | 'R' -> [m; a; r + 1; c; h]
    | 'C' -> [m; a; r; c + 1; h]
    | 'H' -> [m; a; r; c; h + 1]
    | _ -> [m; a; r; c; h]) [0; 0; 0; 0; 0] ss
  |> comb 3
  |> List.map (List.fold_left ( * ) 1)
  |> List.fold_left ( + ) 0
  |> Printf.printf "%d\n"