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: Accepted)

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

namespace dPCC3
{
    class Program
    {
        static void Main(string[] args)
        {
            int ans = 0;
            int AB = 0;
            int BA = 0;
            int BX = 0;
            int XA = 0;
            int N = int.Parse(Console.ReadLine());
            string[] s = new string[N];
            for (int i = 0; i < N; i++)
            {
                s[i] = Console.ReadLine();
                for (int j = 0; j < s[i].Length - 1; j++)//ABの個数
                {
                    if (s[i][j] == 'A' && s[i][j + 1] == 'B')
                    {
                        AB++;
                    }
                }
                //Console.WriteLine(AB);
                if (s[i].Substring(0, 1) == "B")
                {
                    if (s[i].Substring(s[i].Length - 1, 1) == "A")
                    {
                        BA++;//"BA"
                    }
                    else
                    {
                        BX++;//"BX"
                    }
                }
                else if (s[i].Substring(s[i].Length - 1, 1) == "A")
                {
                    XA++;//"XA"
                }
            }
            //Console.WriteLine(AB+" "+BA+" "+BX+" "+XA);
            if (BA > 0) //BAがあって
            {
                if (BX == 0 && XA == 0)//BAだけの時
                {
                    ans = AB + BA - 1;
                }
                if (BX == 0 && XA > 0)//XAとBA
                {
                    ans = AB + BA;
                }
                if (BX > 0 && XA == 0)//BAとBX
                {
                    ans = AB + BA;
                }
                if (XA > 0 && BX > 0)//XA BA BXがあるとき
                {
                    ans = AB + BA + 1 + Math.Min(XA - 1, BX - 1);
                }
            }
            else // BAがなくて
            {
                if (BX > 0 && XA > 0)
                {
                    ans = AB + Math.Min(XA, BX);
                }
                else
                {
                    ans = AB;
                }
                /*
                if (BX == 0 && XA == 0)//ABだけのとき
                {
                    ans = AB;
                }
                if (BX > 0 && XA == 0)
                {
                    ans = AB;
                }
                if (BX == 0 && XA > 0)
                {
                    ans = AB;
                }
                */
            }
            Console.WriteLine(ans);
        }
    }
}