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 main
  implicit none
  integer :: i, j, n, lt, cnt = 0, a = 0, b = 0, ab = 0
  character*10 :: s

  read *, n
  do i = 1, n
    read *, s
    lt = len_trim(s)
    if ((s(1:1) /= 'B') .and. (s(lt:lt) == 'A')) a = a + 1
    if ((s(1:1) == 'B') .and. (s(lt:lt) /= 'A')) b = b + 1
    if ((s(1:1) == 'B') .and. (s(lt:lt) == 'A')) ab = ab + 1
    do j = 1, lt
      if (s(j: j+1) == 'AB') cnt = cnt + 1
    end do
  end do
  if (a > b) then
    print '(i0)', cnt + b + ab
  else if (b > a) then
    print '(i0)', cnt + a + ab
  else
    print '(i0)', cnt + a + max(0, ab-1)
  end if
end program