#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
using PII = std::pair<int, int>;
using PLL = std::pair<ll, ll>;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define allpt(v) (v).begin(), (v).end()
#define allpt_r(v) (v).rbegin(), (v).rend()



const int mod = 1e9 + 7;
const string wsp = " ";
const string tb = "\t";
const string rt = "\n";

template <typename T>
void show1dvec(vector<T> v)
{
    int n = v.size() - 1;
    rep(i, n) cout << v[i] << wsp;
    cout << v[n] << rt;
    return;
}

template <typename T>
void show2dvec(vector<vector<T>> v)
{
    int n = v.size();
    rep(i, n) show1dvec(v[i]);
}

template <typename T>
ll pow_mod(T p, T q, int mod)
{
    ll ret, r;
    ret = 1;
    r = p;

    while (q > 0)
    {

        if (q % 2)
        {
            ret *= r;
            ret %= mod;
        }

        r = (r * r) % mod;
        q /= 2;
    }

    return ret % mod;
}

int main()
{

#ifdef DEBUG
    cout << "DEBUG MODE" << endl;
    ifstream in("input.txt"); //for debug
    cin.rdbuf(in.rdbuf());    //for debug
#endif

    string s;
    cin >> s;
    int c = 0, ans = 0;
    vector<PII> a;
    rep(i, s.length())
    {
        if (s[i] == 'A')
        {
            a.push_back(make_pair(i, c));
            c++;
        }
    }
    for (auto z : a) ans += z.first - z.second;
    cout << ans << rt;

    return 0;
}