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 (GNU Fortran 9.2.1) (judge verdict: Wrong Answer)

program prob3
    implicit none
    integer::N, i, l, ans, a, b, c, j
    character(len=10)::s

    ans = 0
    a = 0
    b = 0
    read(*,*) N
    do j = 1, N
        read(*,*) s
        l = len_trim(s)
        do i = 1, l-1
            if(s(i:i) .eq. "A" .and. s(i+1:i+1) .eq. "B") then
                ans = ans + 1
            end if
        end do
        if(s(1:1) .eq. "B")then
            b = b+1
        end if
        if(s(l:l) .eq. "A")then
            a = a+1
        end if
    end do
    ans = ans + min(a,b)
    write(*,*) ans

    stop
end program