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 JavaScript (node.js v5.12) (judge verdict: Wrong Answer)

inp = require('fs').readFileSync('/dev/stdin', 'utf8').trim().split('\n')
N = inp.shift() * 1
a = 0
b = 0
ab = 0
c = 0
for (i=0; i<N; i++) {
    s = inp[i]
    if (s[0] == 'B' && s[s.length - 1] == 'A') {
        ab += 1
    } else if (s[s.length - 1] == 'A') {
        a += 1
    } else if (s[0] == 'B') {
        b += 1
    }
    for (j=0; j<s.length-1; j++) {
        if (s[j] == 'A' && s[j+1] == 'B') {
            c++
        }
    }
}
if (b>0) {
    b--
    c += ab
    ab = 0
    if (a>0) {
        c++
        a--
    }
}
if (a>0) {
    a--
    c += ab
    ab = 0
    if (b>0) {
        c++
        b--
    }
}
c += Math.min(a,b)
console.log(c)