QAQ

题目大意： 给定一个字符串，字符串长度<=100，现在要求出字符串中'QAQ'的个数，注意，'QAQ'可以不连续，只要有顺序就可以了，例如QABQ也有一个QAQ Translated by @Hjl1777

"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/nekoyaliuBort 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.

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

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

QAQAQYSYIOIWIN

4

QAQQQZZYNOIWIN

3

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