MathNet 2015-part-07 — 185 problems (EN–VI) Question 100

Call a string of letters $S$ an almost palindrome if $S$ and the reverse of $S$ differ in exactly two places.
Find the number of ways to order the letters in HMMTTHEMETEAM to get an almost palindrome.