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 <string.h>

int main(void) {
    int N,ryou = 0,first = 0,last = 0,AB = 0,a,i,j;
    char S[12];
    scanf("%d",&N);
    for (i = 0;i < N;i++) {
        scanf("%s",S);
        a = strlen(S);
        for (j = 0;j < a - 1;j++) {
            if (S[j] == 'A' && S[j + 1] == 'B') AB++;
        }
        if (S[0] == 'B' && S[a - 1] == 'A') {
            ryou++;
        } else if (S[0] == 'B') {
            first++;
        } else if (S[a - 1] == 'A') {
            last++;
        }
    }
    if (first == 0 && last == 0) {
        printf("%d\n",ryou + AB - 1);
    } else if (first <= last) {
        printf("%d\n",first + ryou + AB);
    } else {
        printf("%d\n",last + ryou + AB);
    }
    return 0;
}