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 Kotlin (1.0.0) (judge verdict: Accepted)

fun main(args: Array<String>) {
    val n = readLine()!!.toInt()
    var a = 0
    var b = 0
    var aabb = 0
    var ab = 0
    for (i in 0 until n) {
        val text = readLine()!!.toString()
        for (j in 0 until text.length - 1) {
            if (text[j] == 'A' && text[j + 1] == 'B') ab++
        }
        if (text[0] == 'B' && text[text.length - 1] != 'A') b++
        else if (text[0] != 'B' && text[text.length - 1] == 'A') a++
        else if (text[0] == 'B' && text[text.length - 1] == 'A') aabb++
    }
    if (aabb >= 1) {
        if (a == b && a > 0) {
            println(ab + a + aabb)
        } else {
            println(ab + Math.max(Math.min(a + aabb, b + aabb - 1), Math.min(a + aabb - 1, b + aabb)))
        }
    } else {
        println(ab + Math.min(a, b))
    }
}