a=input()
cnt=0
n=len(a)
for i in range(n):
for j in range(i+1, n):
for y in range(j+1, n):
if a[i]==a[y]=='Q' and a[j]=='A':
cnt+=1
print(cnt)#include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
int c=0;
cin>>s;
for(int i=0;i<s.size();i++)
{
for(int j=i+1;j<s.size();j++)
for(int z=j+1;z<s.size();z++)
if(s[i]=='Q'&&s[j]=='A'&&s[z]=='Q')
c++;
}
cout<<c;
return 0;
}
489A - SwapSort | 932A - Palindromic Supersequence |
433A - Kitahara Haruki's Gift | 672A - Summer Camp |
1277A - Happy Birthday Polycarp | 577A - Multiplication Table |
817C - Really Big Numbers | 1355A - Sequence with Digits |
977B - Two-gram | 993A - Two Squares |
1659D - Reverse Sort Sum | 1659A - Red Versus Blue |
1659B - Bit Flipping | 1480B - The Great Hero |
1519B - The Cake Is a Lie | 1659C - Line Empire |
515A - Drazil and Date | 1084B - Kvass and the Fair Nut |
1101A - Minimum Integer | 985D - Sand Fortress |
1279A - New Year Garland | 1279B - Verse For Santa |
202A - LLPS | 978A - Remove Duplicates |
1304A - Two Rabbits | 225A - Dice Tower |
1660D - Maximum Product Strikes Back | 1513A - Array and Peaks |
1251B - Binary Palindromes | 768B - Code For 1 |