#include <iostream>
#include <string>
#include <algorithm>

using namespace std;

int solve(string s) {
    int r = 0;
    int aid, bid;
    do {
        aid = -1, bid = -1;
        for (int i = 0; i < s.length(); i++) {
            if (s[i] == 'A') {
                aid = i;
            } else if (s[i] == 'B') {
                bid = i;
            }
            if (aid != -1 && bid != -1) {
                s[aid] = 'C';
                s[bid] = 'C';
                break;
            }
        }
    } while(aid != -1 && bid != -1);
    
    for (int i = 0, count = 0; i < s.length(); i++) {
        if (s[i] == 'C') {
            count++;
        } else {
            count = 0;
        }
        if (count > r) {
            r = count;
        }
    }
    return r;
}


int main() {
    string s;
    cin >> s;
    string rs = s;
    reverse(rs.begin(), rs.end());
    cout << max(solve(s), solve(rs)) << endl;
}