import std.conv, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } void chmin(T)(ref T t, in T f) { if (t > f) t = f; } void chmax(T)(ref T t, in T f) { if (t < f) t = f; } int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; } int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); } int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); } int N; string S; void main() { try { for (; ; ) { S = readToken(); N = cast(int)(S.length); auto sum = new int[N + 1]; foreach (i; 0 .. N) { sum[i + 1] = sum[i] + ((S[i] == 'A') ? +1 : -1); } auto mins = new int[N * 2 + 1]; mins[] = N + 1; int ans; foreach (i; 0 .. N + 1) { chmax(ans, i - mins[N + sum[i]]); chmin(mins[N + sum[i]], i); } writeln(ans); } } catch (EOFException e) { } }