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;
using System.Collections.Generic;

namespace AtcoderProgram
{
    class Program
    {
        static void Main(string[] args)
        {
            int count = 0;
            int countA = 0;
            int countB = 0;

            var strings = new List<string>();
            var num = int.Parse(Console.ReadLine());
            for (int i = 0; i < num; i++)
            {
                string line = Console.ReadLine();
                strings.Add(line);

                int index = 0;
                var length = line.Length;
                if (line.EndsWith("A")) countA++;
                if (line.StartsWith("B")) countB++;

                while ((index = line.IndexOf("AB")) >= 0)
                {
                    index++;
                    count++;
                    if (index > length - 1) break;
                    line = line.Substring(index);

                }
            }


            Console.WriteLine(count + Math.Min(countA, countB));

        }


    }

}