A12526. Love "A"

Alice has a string $s$ . She really likes the letter "a". She calls a string good if strictly more than half of the characters in that string are "a"s. For example "aaabb", "axaa" are good strings, and "baca", "awwwa", "" (empty string) are not.

Alice can erase some characters from her string $s$ . She would like to know what is the longest string remaining after erasing some characters (possibly zero) to get a good string. It is guaranteed that the string has at least one "a" in it, so the answer always exists.

The first line contains a string $s$ ( $1 \leq |s| \leq 50$ ) consisting of lowercase English letters. It is guaranteed that there is at least one "a" in $s$ .

Print a single integer, the length of the longest good string that Alice can get after erasing some characters from $s$ .

In the first example, it's enough to erase any four of the "x"s. The answer is $3$ since that is the maximum number of characters that can remain.

In the second example, we don't need to erase any characters.