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 Fortran (gfortran v4.8.4) (judge verdict: Wrong Answer)

PROGRAM ATCODER

implicit none
integer(16) :: n,i,j,count=0,count_a=0,count_b=0,count_ab=0
character(len=10),allocatable :: s(:)

read*, n
allocate(s(n))
read*, s(1:n)

do i = 1, n
  do j = 1, len_trim(s(i))-1
    if ( s(i)(j:j+1) == 'AB' ) then
      count = count + 1
    end if
  end do
  if ( s(i)(1:1) == 'B' ) then
    count_b = count_b + 1
  end if   
  if ( s(i)(len_trim(s(i)):len_trim(s(i))) == 'A' ) then
    count_a = count_a + 1
  end if
  if ( s(i)(1:1) == 'B' .and. s(i)(len_trim(s(i)):len_trim(s(i))) == 'A' ) then
    count_ab = count_ab + 1
  end if
end do

count_a = count_a - count_ab
count_b = count_b - count_ab

if ( count_a == 0 .and. count_b == 0 ) then
  print'(i0)',  count + count_ab - 1
else
  print'(i0)',  count + min(count_a,count_b) + count_ab
end if

END PROGRAM ATCODER