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: Time Limit Exceeded)

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

class Program {
    static void Main(string[] args) {
        //入力
        int N = int.Parse(Console.ReadLine());

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

        //解答となる数値
        int ans = 0;

        int endsA = 0;  //Aで終わる文字列の個数
        int startsB = 0;  //Bで始まる文字列の個数

        int containsAB = 0;  //ABが文字列中に含まれる箇所の数

        //検証
        for (int i = 0; i < N; i++) {
            if (s[i][0] == 'B') startsB++;
            if (s[i][s[i].Length - 1] == 'A') endsA++;
        }

        //いずれか小さいほうを解答に加える
        ans += Math.Min(endsA, startsB);

        for (int i = 0; i < N; i++) {
            while(s[i].IndexOf("AB") >= 0) {
                s[i].Replace("AB", "XX");
                containsAB++;
            }
        }

        //AB文字列中の個数も回答に加える
        ans += containsAB;

        //出力
        Console.WriteLine(ans);
    }
}