A781 | [USACO 2015 February Bronze]COW

Bessie the cow has stumbled across an intriguing inscription carved into a large stone in the middle of her favorite grazing field. The text of the inscription appears to be from a cryptic ancient language involving an alphabet with only the three characters C, O, and W. Although Bessie cannot decipher the text, she does appreciate the fact that C, O, and W in sequence forms her favorite word, and she wonders how many times COW appears in the text.

Bessie doesn't mind if there are other characters interspersed within COW, only that the characters appear in the correct order. She also doesn't mind if different occurrences of COW share some letters. For instance, COW appears once in CWOW, twice in CCOW, and eight times in CCOOWW.

Given the text of the inscription, please help Bessie count how many times COW appears.

INPUT FORMAT:
The first line of input consists of a single integer N <= 10^5. The second line contains of a string of N characters, where each character is either a C, O, or W.

OUTPUT FORMAT:
Output the number of times COW appears as a subsequence, not necessarily contiguous, of the input string.

Note that the answer can be very large, so make sure to use 64 bit integers ("long long" in C++, "long" in Java) to do your calculations.

母牛贝西在她最喜欢的牧场中间偶然发现了一块刻在大石头上的有趣的铭文。铭文的文字似乎来自一种神秘的古代语言，其中只有三个字母 $C$、$O$ 和 $W$。她想知道 $COW$在文本中出现了多少次。

贝西不介意其他字母穿插在 $COW$ 中，只要字母按正确的顺序出现即可。她也不介意如果不同的 $COW$ 共享一些字母。例如，$COW$ 在 $CWOW$ 中出现一次，在 $CCOW$ 中出现两次，在 $CCOWW$ 中出现八次。

请帮助贝西计算有多少次$COW$出现。

第一行输入包含一个整数 $N < = 10 ^ 5$。第二行包含一个由 $N$ 个字符组成的字符串，其中每个字符都是$C、 O$ 或 $W$。

输出 $COW$ 作为输入字符串的子序列(不一定是连续的)出现的次数。

注意，答案可能非常大，所以一定要使用 $64$位整数 $(C++$ 中的“ $long long$”， $Java$ 中的“ $long$”)来进行计算。