import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, 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; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } void main() { try { for (; ; ) { const N = readInt; const S = readToken; int ans; // BB { bool ok; foreach (i; 0 .. N - 1) { ok = ok || (S[i] == 'B' && S[i + 1] == 'B'); } if (ok) { ++ans; } } // AB, BA { auto fs = new bool[N]; foreach (i; 0 .. N - 1) { if (S[i] == 'A' && S[i + 1] == 'B') fs[i] = true; if (S[i] == 'B' && S[i + 1] == 'A') fs[i + 1] = true; } foreach (i; 0 .. N) if (fs[i]) { ++ans; } } // AA foreach (i; 0 .. N - 1) { if (S[i] == 'A' && S[i + 1] == 'A') { ++ans; } } writeln(ans); } } catch (EOFException e) { } }