#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    string s;
    cin >> s;
    ll n = len(s);
    vector<ll> dp(n + 1, 0);
    map<ll, ll> idx;
    rep(i, n) {
        ll v = (s[i] == 'A') ? 1 : -1;
        dp[i + 1] = dp[i] + v;
        idx[dp[i + 1]] = i + 1;
    }
    ll ans = 0;
    rep(i, n + 1) {
        ll d = idx[dp[i]] - i;
        ans = max(ans, d);
    }
    cout << ans << endl;
    return 0;
}