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 C (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <stdio.h>
#include <stdlib.h>

int main()
{
    int n;
    scanf("%d", &n);
    int a = 0, b = 0, ans = 0;
    char s[10000][10] = {0};
    int l[10000] = {0};
    int i, j;
    for (i = 0; i < n; i++)
    {
        scanf("%s", s[i]);
        j = 0;
        while (s[i][j])
        {
            l[i]++;
            j++;
        }
    }
    for (i = 0; i < n; i++)
    {
        if (s[i][0] == 'B')
        {
            b++;
        }
        if (s[i][l[i] - 1] == 'A')
        {
            a++;
        }
        for (j = 0; j < l[i] - 1; j++)
        {
            if (s[i][j] == 'A' && s[i][j + 1] == 'B')
            {
                ans++;
            }
        }
    }
    if (a > b)
    {
        ans += b;
    }
    else
    {
        ans += a;
    }
    printf("%d\n", ans);
    return 0;
}