Find the number of permutations of the letters $AAAABBBCC$ where no letter is next to another letter of the same type. For example, count $ABCABCABA$ and $ABABCABCA$ but not $ABCCBABAA$.

Let's think step by step and output the final answer within \boxed{}.
user