import core.bitop;
import std.algorithm;
import std.ascii;
import std.bigint;
import std.conv;
import std.functional;
import std.math;
import std.numeric;
import std.range;
import std.stdio;
import std.string;
import std.random;
import std.typecons;
import std.container;

alias sread = () => readln.chomp();
alias Point2 = Tuple!(long, "y", long, "x");

T lread(T = long)()
{
    return readln.chomp.to!T();
}

T[] aryread(T = long)()
{
    return readln.split.to!(T[])();
}

void scan(TList...)(ref TList Args)
{
    auto line = readln.split();
    foreach (i, T; TList)
    {
        T val = line[i].to!(T);
        Args[i] = val;
    }
}

void main()
{
    long n = lread();
    auto s = new string[n];
    foreach (ref e; s)
    {
        e = sread();
    }
    long count;
    auto first_b = new long[n];
    auto last_a = new long[n];
    foreach (i, e; s)
    {
        foreach (j; 0 .. e.length - 1)
        {
            if (e[j .. j + 2] == "AB")
            {
                count++;
            }
        }
        if (e[0] == 'B')
        {
            first_b[i]++;
        }
        if (e[$ - 1] == 'A')
        {
            last_a[i]++;
        }
    }
    long allequal;
    foreach (i; 0 .. n)
    {
        if (first_b[i] == last_a[i])
        {
            allequal++;
        }
    }
    if (allequal == n)
    {
        count--;
    }
    auto mintwo = min(first_b.sum, last_a.sum);
    writeln(count + mintwo);
}