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 diverta2019c
    use,intrinsic :: iso_fortran_env
    implicit none
    integer(int32):: n,l
    character(10),allocatable:: s(:)
    integer(int32):: i, ca, cb, cab,ans

    ca=0; cb=0; cab=0; ans=0
    read*, n
    allocate(s(n))
    do i=1,n
        read*, s(i)
    end do

    do i=1,n
        if (index(s(i),'AB') /= 0) ans=ans+1
    end do

    do i=1,n
        l = len_trim(s(i))
        if (s(i)(1:1) /= 'B' .and. s(i)(l:l) /= 'A') cycle

        if (s(i)(1:1) == 'B' .and. s(i)(l:l) == 'A') then
            cab=cab+1
        else if (s(i)(1:1) == 'B') then
            cb=cb+1
        else
            ca=ca+1
        end if
    end do

    if (ca == 0 .and. cb==0) then
        print'(i0)', ans+cab-1
    else
        print'(i0)', ans+min(ca+cab,cb+cab)
    end if

end program diverta2019c