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;
class Program
{
	static void Main(string[] args)
	{
	  int N = int.Parse(Console.ReadLine());
      int result = 0;
      int endA = 0;
      int beginB = 0;
      for(int i = 0; i < N; i++)
      {
          string str = Console.ReadLine();
          beginB = (str[0] == 'B') ? beginB++ : beginB;
          endA = (str[str.Length-1] == 'A') ? endA++ : endA;
          for(int j = 0; j < str.Length - 2; j++)
          {
             if(str[j] == 'A' && str[j+1] == 'B') result++;
          }
      }
      
      int combine = Math.Min(endA, beginB);
      result += combine;
      
      Console.WriteLine("{0}", result);
	}
}