Problem:
Score : 400 points

Problem Statement

Snuke has N strings. The i-th string is s_i.

Let us concatenate these strings into one string after arranging them in some order.
Find the maximum possible number of occurrences of AB in the resulting string.

Constraints

1 \leq N \leq 10^{4}

2 \leq |s_i| \leq 10

s_i consists of uppercase English letters.

Input

Input is given from Standard Input in the following format:

N
s_1
\vdots
s_N

Output

Print the answer.

Sample Input 1

3
ABCA
XBAZ
BAD

Sample Output 1

2

For example, if we concatenate ABCA, BAD and XBAZ in this order, the resulting string ABCABADXBAZ has two occurrences of AB.

Sample Input 2

9
BEWPVCRWH
ZZNQYIJX
BAVREA
PA
HJMYITEOX
BCJHMRMNK
BP
QVFABZ
PRGKSPUNA

Sample Output 2

4

Sample Input 3

7
RABYBBE
JOZ
BMHQUVA
BPA
ISU
MCMABAOBHZ
SZMEHMA

Sample Output 3

4

Solution in C# (Mono 4.6.2.0) (judge verdict: Wrong Answer)

using System;

public class Class1
{
    static void Main(string[] args)
    {
        int N = int.Parse(Console.ReadLine());
        string[] input = new string[N];

        for (int i = 0; i < N; i++)
        {
            input[i] = Console.ReadLine();
        }

        int ABc = 0;
        int BtoAc = 0;
        int Ac = 0;
        int Bc = 0;
        foreach (string s in input)
        {
            if (s.EndsWith("A") && s.StartsWith("B")) BtoAc++;
            else if (s.EndsWith("A")) Ac++;
            else if (s.StartsWith("B")) Bc++;
            ABc += (s.Length - s.Replace("AB", "").Length) / 2;
        }

       // Console.WriteLine(ABc + " " + BtoAc + " " + Ac + " " + Bc);

        int ans = ABc;

        if(BtoAc != 0)ans += BtoAc - 1;
        ans += Math.Min(Ac, Bc);

        if (Ac != Bc) ans++;


        Console.WriteLine(ans);
    }
}