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 Pascal (FPC 2.6.2) (judge verdict: Wrong Answer)

var t,i,n,ans : longint;
    b : array[1..3] of longint;
    p,c : char;


function min(a,b:int64):int64;
begin
  if a < b then min := a else min := b
end;

begin
  read(n);
  ans := 0;
  for t := 1 to 3 do b[t] := 0;
  for i := 0 to n do begin
    read(p);
    if p = 'B' then t := 1 else t := 0;
    while not eoln do begin
      read(c);
      if (p = 'A') and (c = 'B') then ans := ans + 1;
      p := c
    end;
    readln;
    if c = 'A' then t := t + 2;
    if t > 0 then b[t] := b[t] + 1
  end;
  if (b[1] = 0) and (b[2] = 0) then ans := ans + b[3] - 1
    else ans := ans + min(b[1],b[2]) + b[3];
  writeln(ans)
end.