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;
 
namespace Sample
{
  class Program
  {
    static void Main()
    {
      int Count=0,cou_A=0,cou_B=0;
      int n = int.Parse(Console.ReadLine());
      string[] array = new string[n];
      for(int i=0; i<n; ++i)
      {
          array[i] = Console.ReadLine();
          if(0 <= array[i].IndexOf("AB"))
          {
            Count += 1;
          }
          if(array[i].StartsWith("A"))
          {
            cou_A += 1;
          }
          if(array[i].EndsWith("B"))
          {
            cou_B += 1;
          }
      }
      
	  if(cou_A >= cou_B)
      {
        Console.WriteLine(Count+cou_B);
      }else{
        Console.WriteLine(Count+cou_A);
      }
      
    }
  }
}