CF894A.QAQ

"QAQ" is a word to denote an expression of crying. Imagine "Q" as eyes with tears and "A" as a mouth.

Now Diamond has given Bort a string consisting of only uppercase English letters of length n. There is a great number of "QAQ" in the string (Diamond is so cute!).

illustration by 猫屋 https://twitter.com/nekoyaliu

Bort wants to know how many subsequences "QAQ" are in the string Diamond has given. Note that the letters "QAQ" don't have to be consecutive, but the order of letters should be exact.

“QAQ”是一个表示哭泣表情的词，其中“Q”象征含泪的双眼，“A”象征嘴巴。

现在，Diamond 给了 Bort 一个长度为 $n$ 的、仅由大写英文字母组成的字符串。该字符串中包含大量“QAQ”（Diamond 实在太可爱了！）

插画作者：猫屋 https://twitter.com/nekoyaliu

Bort 想知道，在 Diamond 给出的字符串中，有多少个子序列恰好为“QAQ”。注意：“QAQ”中的字母不必连续，但字母顺序必须严格保持。

The only line contains a string of length n (1 ≤ n ≤ 100). It's guaranteed that the string only contains uppercase English letters.

仅有一行，包含一个长度为 $n$（$1 \leq n \leq 100$）的字符串。保证该字符串仅由大写英文字母组成。

Print a single integer — the number of subsequences "QAQ" in the string.

输出一个整数——字符串中子序列“QAQ”的个数。

In the first example there are 4 subsequences "QAQ": "QAQAQYSYIOIWIN", "QAQAQYSYIOIWIN", "QAQAQYSYIOIWIN", "QAQAQYSYIOIWIN".

在第一个例子中，有 4 个子序列 "QAQ"："QAQAQYSYIOIWIN"、"QAQAQYSYIOIWIN"、"QAQAQYSYIOIWIN"、"QAQAQYSYIOIWIN"。